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/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:24:07,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:24:07,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:24:07,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:24:07,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:24:07,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:24:07,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:24:07,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:24:07,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:24:07,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:24:07,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:24:07,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:24:07,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:24:07,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:24:07,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:24:07,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:24:07,892 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:24:07,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:24:07,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:24:07,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:24:07,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:24:07,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:24:07,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:24:07,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:24:07,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:24:07,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:24:07,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:24:07,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:24:07,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:24:07,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:24:07,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:24:07,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:24:07,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:24:07,909 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:24:07,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:24:07,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:24:07,911 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:24:07,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:24:07,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:24:07,934 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:24:07,934 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:24:07,934 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:24:07,934 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:24:07,935 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:24:07,935 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:24:07,935 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:24:07,935 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:24:07,935 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:24:07,935 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:24:07,936 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:24:07,936 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:24:07,936 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:24:07,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:24:07,937 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:24:07,937 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:24:07,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:24:07,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:24:07,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:24:07,939 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:24:07,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:24:07,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:24:07,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:24:07,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:24:07,940 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:24:07,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:24:07,941 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:24:07,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:24:07,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:24:07,942 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:24:07,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:24:07,942 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:24:07,942 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:24:07,942 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:24:07,943 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:24:07,943 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:24:07,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:24:07,943 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:24:07,943 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:24:07,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:24:08,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:24:08,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:24:08,005 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:24:08,005 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:24:08,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 16:24:08,006 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 16:24:08,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:24:08,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:24:08,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:24:08,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:24:08,040 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:24:08,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:24:08,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:24:08,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:24:08,078 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:24:08,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/1) ... [2018-12-03 16:24:08,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:24:08,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:24:08,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:24:08,099 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:24:08,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (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:24:08,179 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 16:24:08,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:24:08,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:24:08,427 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:24:08,427 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:24:08,429 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:24:08 BoogieIcfgContainer [2018-12-03 16:24:08,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:24:08,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:24:08,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:24:08,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:24:08,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:08" (1/2) ... [2018-12-03 16:24:08,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dae236b and model type count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:24:08, skipping insertion in model container [2018-12-03 16:24:08,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:24:08" (2/2) ... [2018-12-03 16:24:08,440 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 16:24:08,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:24:08,465 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:24:08,492 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:24:08,538 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:24:08,538 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:24:08,538 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:24:08,538 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:24:08,540 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:24:08,540 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:24:08,541 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:24:08,541 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:24:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:24:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:24:08,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:08,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:24:08,583 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:08,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:08,592 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-12-03 16:24:08,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:08,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:08,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:08,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:08,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:08,780 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:24:08,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:08,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:24:08,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:08,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:24:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:24:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:24:08,802 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:24:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:08,850 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:24:08,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:24:08,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:24:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:08,863 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:24:08,863 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:24:08,867 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:24:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:24:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:24:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:24:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:24:08,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:24:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:08,905 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:24:08,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:24:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:24:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:24:08,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:08,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:24:08,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:08,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:08,907 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-12-03 16:24:08,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:08,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:08,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:08,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:09,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:09,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:09,065 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:24:09,068 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:24:09,149 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:24:09,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:24:09,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:24:09,397 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:24:09,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:09,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:24:09,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:09,443 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:24:09,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:09,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:09,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:09,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:09,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:09,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:24:09,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:09,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:24:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:24:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:24:09,614 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 16:24:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:09,645 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:24:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:24:09,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:24:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:09,646 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:24:09,646 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:24:09,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:24:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:24:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:24:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:24:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:24:09,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:24:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:09,652 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:24:09,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:24:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:24:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:24:09,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:09,654 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:24:09,654 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:09,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-12-03 16:24:09,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:09,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:09,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:09,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:09,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:09,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:09,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:09,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:09,759 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:24:09,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:09,759 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:24:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:09,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:09,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:24:09,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:09,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:09,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:09,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:09,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:24:09,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:09,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:24:09,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:24:09,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:24:09,967 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 16:24:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:09,998 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:24:10,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:24:10,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:24:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:10,001 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:24:10,001 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:24:10,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:24:10,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:24:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:24:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:24:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:24:10,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:24:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:10,005 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:24:10,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:24:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:24:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:24:10,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:10,006 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:24:10,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:10,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-12-03 16:24:10,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:10,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:10,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:10,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:10,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:10,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:10,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:10,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:24:10,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:10,261 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:24:10,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:10,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:10,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:10,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:10,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:10,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:10,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:10,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:24:10,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:10,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:24:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:24:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:10,493 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 16:24:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:10,517 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:24:10,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:24:10,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:24:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:10,520 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:24:10,521 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:24:10,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:24:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:24:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:24:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:24:10,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:24:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:10,525 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:24:10,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:24:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:24:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:24:10,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:10,526 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:24:10,526 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:10,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-12-03 16:24:10,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:10,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:10,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:10,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:10,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:10,685 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:10,685 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:24:10,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:10,686 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:24:10,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:10,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:10,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:10,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:10,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:10,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:24:10,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:10,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:24:10,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:24:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:24:10,883 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 16:24:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:10,906 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:24:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:24:10,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:24:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:10,907 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:24:10,907 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:24:10,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:24:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:24:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:24:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:24:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:24:10,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:24:10,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:10,911 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:24:10,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:24:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:24:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:24:10,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:10,912 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:24:10,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:10,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:10,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-12-03 16:24:10,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:10,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:10,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:11,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:11,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:11,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:11,081 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:24:11,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:11,081 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:24:11,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:11,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:11,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:24:11,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:11,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:11,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:11,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:11,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:24:11,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:11,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:24:11,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:24:11,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:24:11,558 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 16:24:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:11,583 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:24:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:24:11,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:24:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:11,585 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:24:11,585 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:24:11,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:24:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:24:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:24:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:24:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:24:11,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:24:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:11,590 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:24:11,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:24:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:24:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:24:11,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:11,591 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:24:11,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:11,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-12-03 16:24:11,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:11,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:11,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:11,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:11,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:11,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:11,712 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:11,712 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:24:11,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:11,712 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:24:11,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:11,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:11,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:11,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:11,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:11,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:11,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:11,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:24:11,941 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:11,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:24:11,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:24:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:24:11,943 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 16:24:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:11,983 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:24:11,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:24:11,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:24:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:11,985 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:24:11,985 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:24:11,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:24:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:24:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:24:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:24:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 16:24:11,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 16:24:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:11,990 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 16:24:11,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:24:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 16:24:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:24:11,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:11,990 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:24:11,991 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:11,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-12-03 16:24:11,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:11,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:11,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:11,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:12,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:12,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:12,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:12,189 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:24:12,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:12,189 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:24:12,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:12,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:12,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:12,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:12,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:12,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:24:12,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:12,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:24:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:24:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:24:12,543 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 16:24:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:12,607 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 16:24:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:24:12,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:24:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:12,609 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:24:12,609 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:24:12,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:24:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:24:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:24:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:24:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:24:12,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 16:24:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:12,613 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:24:12,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:24:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:24:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:24:12,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:12,614 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:24:12,614 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:12,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-12-03 16:24:12,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:12,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:12,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:12,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:12,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:12,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:12,923 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:12,923 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:24:12,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:12,924 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:24:12,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:12,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:12,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:24:12,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:12,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:12,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:13,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:13,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:24:13,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:13,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:24:13,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:24:13,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:24:13,266 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 16:24:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:13,299 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:24:13,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:24:13,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:24:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:13,300 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:24:13,300 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:24:13,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:24:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:24:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:24:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:24:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 16:24:13,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 16:24:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:13,304 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 16:24:13,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:24:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 16:24:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:24:13,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:13,305 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 16:24:13,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:13,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-12-03 16:24:13,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:13,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:13,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:13,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:13,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:13,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:13,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:13,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:13,444 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:24:13,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:13,445 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:24:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:13,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:13,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:13,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:13,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:13,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:13,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:24:13,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:13,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:24:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:24:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:24:13,777 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 16:24:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:13,813 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 16:24:13,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:24:13,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:24:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:13,815 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:24:13,815 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:24:13,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:24:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:24:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:24:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:24:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:24:13,820 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 16:24:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:13,820 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:24:13,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:24:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:24:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:24:13,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:13,821 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 16:24:13,822 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:13,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-12-03 16:24:13,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:13,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:13,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:14,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:14,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:14,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:14,017 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:24:14,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:14,017 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:24:14,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:14,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:14,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:14,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:14,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:14,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:24:14,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:14,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:24:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:24:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:24:14,482 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 16:24:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:14,513 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:24:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:24:14,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 16:24:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:14,515 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:24:14,515 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:24:14,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:24:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:24:14,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:24:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:24:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 16:24:14,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 16:24:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:14,520 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 16:24:14,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:24:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 16:24:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:24:14,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:14,520 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 16:24:14,521 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:14,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-12-03 16:24:14,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:14,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:14,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:14,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:14,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:14,907 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:14,907 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:24:14,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:14,907 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:24:14,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:14,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:15,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:24:15,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:15,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:15,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:15,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:15,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:24:15,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:15,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:24:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:24:15,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:24:15,701 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 16:24:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:15,736 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 16:24:15,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:24:15,737 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 16:24:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:15,737 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:24:15,738 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:24:15,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:24:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:24:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:24:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:24:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:24:15,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 16:24:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:15,741 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:24:15,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:24:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:24:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:24:15,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:15,742 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 16:24:15,742 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:15,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-12-03 16:24:15,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:15,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:15,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:15,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:16,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:16,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:16,164 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:16,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:24:16,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:16,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 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:24:16,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:16,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:16,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:16,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:16,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:16,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:16,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:16,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:24:16,575 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:16,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:24:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:24:16,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:24:16,576 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 16:24:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:16,629 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:24:16,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:24:16,634 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 16:24:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:16,635 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:24:16,635 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:24:16,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:24:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:24:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:24:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:24:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 16:24:16,639 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 16:24:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:16,639 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 16:24:16,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:24:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 16:24:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:24:16,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:16,640 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 16:24:16,640 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:16,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-12-03 16:24:16,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:16,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:16,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:17,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:17,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:17,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:17,048 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:24:17,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:17,048 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:24:17,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:17,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:17,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:17,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:17,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:17,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:24:17,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:17,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:24:17,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:24:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:24:17,826 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 16:24:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:17,858 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 16:24:17,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:24:17,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 16:24:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:17,862 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:24:17,862 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:24:17,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:24:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:24:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:24:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:24:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:24:17,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 16:24:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:17,867 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:24:17,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:24:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:24:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:24:17,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:17,868 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 16:24:17,868 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:17,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:17,868 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-12-03 16:24:17,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:17,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:18,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:18,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:18,118 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:24:18,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:18,118 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:24:18,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:18,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:18,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:24:18,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:18,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:18,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:18,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:18,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:24:18,598 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:18,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:24:18,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:24:18,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:24:18,600 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 16:24:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:18,628 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:24:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:24:18,629 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 16:24:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:18,630 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:24:18,630 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:24:18,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 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:24:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:24:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:24:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:24:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 16:24:18,634 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 16:24:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:18,635 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 16:24:18,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:24:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 16:24:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:24:18,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:18,636 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 16:24:18,636 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:18,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-12-03 16:24:18,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:18,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:18,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:18,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:18,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:18,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:18,888 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:24:18,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:18,889 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:24:18,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:18,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:18,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:18,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:18,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:18,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:19,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:19,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:24:19,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:19,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:24:19,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:24:19,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:24:19,587 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 16:24:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:19,629 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 16:24:19,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:24:19,629 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 16:24:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:19,630 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:24:19,631 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:24:19,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:24:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:24:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:24:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:24:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:24:19,636 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 16:24:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:19,636 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:24:19,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:24:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:24:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:24:19,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:19,637 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 16:24:19,637 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:19,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-12-03 16:24:19,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:20,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:20,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:20,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:20,527 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:24:20,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:20,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 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:24:20,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:20,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:20,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:20,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:21,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:24:21,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:21,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:24:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:24:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:24:21,399 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 16:24:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:21,424 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 16:24:21,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:24:21,425 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 16:24:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:21,425 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:24:21,425 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:24:21,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:24:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:24:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:24:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:24:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 16:24:21,429 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 16:24:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:21,430 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 16:24:21,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:24:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 16:24:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:24:21,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:21,430 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 16:24:21,431 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:21,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:21,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-12-03 16:24:21,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:21,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:21,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:21,632 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:24:21,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:21,632 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:24:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:21,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:21,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:24:21,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:21,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:22,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:22,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:24:22,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:22,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:24:22,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:24:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:24:22,881 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 16:24:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:22,907 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 16:24:22,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:24:22,908 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 16:24:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:22,908 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:24:22,909 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:24:22,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:24:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:24:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:24:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:24:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 16:24:22,913 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 16:24:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:22,913 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 16:24:22,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:24:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 16:24:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:24:22,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:22,914 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 16:24:22,914 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:22,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:22,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-12-03 16:24:22,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:22,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:22,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:23,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:23,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:23,670 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:23,670 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:24:23,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:23,670 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:24:23,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:23,679 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:23,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:23,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:23,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:23,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:24,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:24:24,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:24,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:24:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:24:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:24:24,160 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 16:24:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:24,253 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:24:24,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:24:24,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 16:24:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:24,254 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:24:24,255 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:24:24,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:24:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:24:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:24:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:24:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 16:24:24,259 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 16:24:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:24,259 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 16:24:24,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:24:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 16:24:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:24:24,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:24,260 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 16:24:24,260 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:24,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:24,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-12-03 16:24:24,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:24,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:24,556 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:24,557 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:24:24,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,557 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:24:24,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:24,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:24,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:25,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:25,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:24:25,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:25,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:24:25,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:24:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:24:25,115 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 16:24:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:25,159 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 16:24:25,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:24:25,160 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 16:24:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:25,160 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:24:25,161 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:24:25,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:24:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:24:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:24:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:24:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 16:24:25,165 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 16:24:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:25,166 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 16:24:25,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:24:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 16:24:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:24:25,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:25,166 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 16:24:25,167 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:25,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:25,167 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-12-03 16:24:25,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:25,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:25,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:25,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:25,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:25,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:25,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:25,606 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:24:25,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,607 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:24:25,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:25,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:25,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:24:25,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:25,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:25,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:26,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:26,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:24:26,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:26,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:24:26,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:24:26,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:24:26,371 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 16:24:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:26,421 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 16:24:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:24:26,422 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 16:24:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:26,423 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:24:26,423 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:24:26,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:24:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:24:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:24:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:24:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 16:24:26,427 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 16:24:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:26,427 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 16:24:26,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:24:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 16:24:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:24:26,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:26,428 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 16:24:26,429 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:26,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-12-03 16:24:26,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:26,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:26,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:26,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:26,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:26,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:26,747 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:24:26,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:26,747 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:24:26,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:26,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:26,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:26,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:26,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:26,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:27,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:27,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:24:27,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:27,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:24:27,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:24:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:24:27,495 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 16:24:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:27,592 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 16:24:27,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:24:27,595 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 16:24:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:27,595 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:24:27,595 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:24:27,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:24:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:24:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:24:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:24:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 16:24:27,599 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 16:24:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:27,600 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 16:24:27,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:24:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 16:24:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:24:27,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:27,600 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 16:24:27,601 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:27,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-12-03 16:24:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:27,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:27,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:27,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:28,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:28,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:28,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:28,051 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:24:28,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:28,051 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:24:28,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:28,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:28,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:28,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:28,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:28,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:24:28,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:28,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:24:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:24:28,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:24:28,847 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 16:24:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:28,882 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:24:28,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:24:28,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 16:24:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:28,885 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:24:28,885 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:24:28,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:24:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:24:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:24:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:24:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 16:24:28,889 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 16:24:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:28,889 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 16:24:28,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:24:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 16:24:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:24:28,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:28,890 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 16:24:28,890 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:28,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:28,890 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-12-03 16:24:28,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:28,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:28,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:28,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:28,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:29,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:29,271 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:29,271 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:24:29,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,272 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:24:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:29,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:29,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:24:29,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:29,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:29,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:30,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:30,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:24:30,078 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:30,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:24:30,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:24:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:24:30,080 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 16:24:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:30,127 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 16:24:30,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:24:30,128 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 16:24:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:30,128 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:24:30,129 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:24:30,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:24:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:24:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:24:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:24:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 16:24:30,135 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 16:24:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:30,135 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 16:24:30,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:24:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 16:24:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:24:30,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:30,136 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 16:24:30,136 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:30,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-12-03 16:24:30,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:30,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:30,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:30,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:30,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:30,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:30,799 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:24:30,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:30,799 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:24:30,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:30,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:30,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:30,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:30,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:30,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:31,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:31,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:24:31,726 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:31,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:24:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:24:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:24:31,728 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 16:24:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:31,790 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 16:24:31,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:24:31,790 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 16:24:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:31,791 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:24:31,791 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:24:31,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:24:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:24:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:24:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:24:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 16:24:31,797 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 16:24:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:31,797 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 16:24:31,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:24:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 16:24:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:24:31,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:31,798 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 16:24:31,798 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:31,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-12-03 16:24:31,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:31,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:31,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:31,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:31,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:33,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:33,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:33,067 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:33,067 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:24:33,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:33,067 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:24:33,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:33,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:33,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:33,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:34,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:34,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:24:34,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:34,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:24:34,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:24:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:24:34,462 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 16:24:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:34,523 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 16:24:34,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:24:34,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 16:24:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:34,524 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:24:34,524 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:24:34,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:24:34,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:24:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:24:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:24:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 16:24:34,528 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 16:24:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:34,529 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 16:24:34,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:24:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 16:24:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:24:34,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:34,529 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 16:24:34,530 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:34,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:34,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-12-03 16:24:34,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:34,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:34,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:34,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:34,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:36,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:36,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:36,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:36,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:24:36,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:36,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 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:24:36,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:36,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:36,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:24:36,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:36,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:36,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:36,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:36,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:24:36,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:36,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:24:36,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:24:36,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:24:36,913 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 16:24:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:37,148 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:24:37,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:24:37,148 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 16:24:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:37,149 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:24:37,149 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:24:37,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:24:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:24:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:24:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:24:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 16:24:37,157 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 16:24:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:37,158 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 16:24:37,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:24:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 16:24:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:24:37,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:37,158 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 16:24:37,159 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:37,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:37,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-12-03 16:24:37,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:37,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:37,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:37,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:38,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:38,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:38,271 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:38,271 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:24:38,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:38,271 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:24:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:38,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:38,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:38,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:38,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:38,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:39,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:39,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:24:39,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:39,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:24:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:24:39,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:24:39,210 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 16:24:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:39,256 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 16:24:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:24:39,257 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 16:24:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:39,257 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:24:39,257 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:24:39,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:24:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:24:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:24:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:24:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 16:24:39,263 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 16:24:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:39,263 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 16:24:39,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:24:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 16:24:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:24:39,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:39,264 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 16:24:39,264 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:39,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-12-03 16:24:39,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:39,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:39,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:39,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:39,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:39,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:39,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:39,726 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:24:39,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:39,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 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:24:39,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:39,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:39,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:39,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:40,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:40,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:24:40,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:40,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:24:40,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:24:40,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:24:40,741 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 16:24:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:40,820 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 16:24:40,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:24:40,820 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 16:24:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:40,821 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:24:40,821 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:24:40,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:24:40,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:24:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:24:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:24:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 16:24:40,826 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 16:24:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:40,826 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 16:24:40,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:24:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 16:24:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:24:40,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:40,827 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 16:24:40,827 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:40,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-12-03 16:24:40,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:40,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:40,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:40,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:40,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:41,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:41,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:41,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:41,253 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:24:41,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:41,253 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:24:41,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:41,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:41,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:24:41,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:41,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:41,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:42,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:42,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:24:42,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:42,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:24:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:24:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:24:42,564 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 16:24:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:42,621 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 16:24:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:24:42,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 16:24:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:42,622 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:24:42,623 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:24:42,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:24:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:24:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:24:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:24:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 16:24:42,626 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 16:24:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:42,627 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 16:24:42,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:24:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 16:24:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:24:42,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:42,627 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 16:24:42,627 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:42,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-12-03 16:24:42,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:42,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:42,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:42,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:42,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:43,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:43,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:43,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:43,643 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:24:43,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:43,643 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:24:43,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:43,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:43,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:43,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:43,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:43,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:44,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:44,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:24:44,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:44,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:24:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:24:44,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:24:44,742 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 16:24:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:44,818 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:24:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:24:44,818 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 16:24:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:44,819 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:24:44,819 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:24:44,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:24:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:24:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:24:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:24:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 16:24:44,823 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 16:24:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:44,823 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 16:24:44,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:24:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 16:24:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:24:44,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:44,823 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 16:24:44,824 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:44,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-12-03 16:24:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:44,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:44,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:45,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:45,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:45,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:45,369 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:24:45,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:45,369 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:24:45,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:45,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:45,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:45,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:46,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:46,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:24:46,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:46,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:24:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:24:46,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:24:46,662 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 16:24:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:46,723 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 16:24:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:24:46,723 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 16:24:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:46,724 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:24:46,724 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:24:46,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:24:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:24:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:24:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:24:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 16:24:46,729 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 16:24:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:46,729 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 16:24:46,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:24:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 16:24:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:24:46,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:46,730 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 16:24:46,730 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:46,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-12-03 16:24:46,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:46,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:46,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:47,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:47,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:47,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:47,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:24:47,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:47,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 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:24:47,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:47,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:47,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:24:47,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:47,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:47,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:49,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:49,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:24:49,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:49,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:24:49,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:24:49,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:24:49,413 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 16:24:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:49,480 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 16:24:49,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:24:49,480 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 16:24:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:49,481 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:24:49,481 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:24:49,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:24:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:24:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:24:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:24:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 16:24:49,485 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 16:24:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:49,486 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 16:24:49,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:24:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 16:24:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:24:49,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:49,487 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 16:24:49,487 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:49,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:49,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-12-03 16:24:49,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:49,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:49,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:49,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:49,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:50,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:50,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:50,219 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:50,219 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:24:50,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:50,220 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:24:50,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:50,229 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:50,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:50,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:50,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:50,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:51,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:51,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:24:51,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:51,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:24:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:24:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:24:51,544 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 16:24:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:51,645 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 16:24:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:24:51,646 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 16:24:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:51,646 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:24:51,646 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:24:51,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:24:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:24:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:24:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:24:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 16:24:51,651 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 16:24:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:51,651 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 16:24:51,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:24:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 16:24:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:24:51,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:51,652 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 16:24:51,652 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:51,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:51,652 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-12-03 16:24:51,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:51,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:51,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:51,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:51,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:52,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:52,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:52,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:52,264 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:24:52,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:52,264 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:24:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:52,272 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:52,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:52,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:24:54,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:54,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:24:54,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:24:54,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:24:54,261 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 16:24:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:54,329 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 16:24:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:24:54,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 16:24:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:54,330 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:24:54,330 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:24:54,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:24:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:24:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:24:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:24:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 16:24:54,334 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 16:24:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:54,334 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 16:24:54,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:24:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 16:24:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:24:54,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:54,335 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 16:24:54,335 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:54,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-12-03 16:24:54,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:54,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:54,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:55,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:55,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:55,258 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:55,258 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:24:55,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:55,258 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:24:55,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:55,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:55,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:24:55,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:55,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:55,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:56,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:56,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:24:56,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:56,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:24:56,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:24:56,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:24:56,735 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 16:24:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:56,787 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 16:24:56,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:24:56,787 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 16:24:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:56,788 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:24:56,788 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:24:56,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:24:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:24:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:24:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:24:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 16:24:56,792 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 16:24:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:56,792 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 16:24:56,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:24:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 16:24:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:24:56,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:56,793 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 16:24:56,793 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:56,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-12-03 16:24:56,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:56,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:56,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:57,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:57,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:57,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:57,443 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:24:57,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:57,443 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:24:57,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:57,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:57,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:57,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:57,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:57,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:59,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:59,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:24:59,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:59,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:24:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:24:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:24:59,620 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 16:24:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:59,675 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 16:24:59,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:24:59,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 16:24:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:59,676 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:24:59,677 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:24:59,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:24:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:24:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:24:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:24:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 16:24:59,680 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 16:24:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:59,680 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 16:24:59,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:24:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 16:24:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:24:59,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:59,681 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 16:24:59,681 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:59,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-12-03 16:24:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:59,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:59,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:00,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:00,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:00,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:00,294 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:25:00,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:00,294 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:25:00,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:00,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:00,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:00,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:01,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:01,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:25:01,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:01,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:25:01,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:25:01,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:25:01,899 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 16:25:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:01,973 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 16:25:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:25:01,974 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 16:25:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:01,974 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:25:01,974 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:25:01,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:25:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:25:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:25:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:25:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 16:25:01,978 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 16:25:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:01,978 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 16:25:01,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:25:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 16:25:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:25:01,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:01,979 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 16:25:01,979 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:01,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-12-03 16:25:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:01,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:01,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:01,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:01,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:02,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:02,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:02,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:02,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:25:02,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:02,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 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:25:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:02,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:02,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:25:02,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:02,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:02,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:04,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:04,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:25:04,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:04,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:25:04,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:25:04,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:25:04,815 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 16:25:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:04,874 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 16:25:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:25:04,875 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 16:25:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:04,875 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:25:04,876 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:25:04,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:25:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:25:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:25:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:25:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 16:25:04,880 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 16:25:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:04,880 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 16:25:04,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:25:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 16:25:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:25:04,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:04,881 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 16:25:04,881 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:04,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-12-03 16:25:04,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:04,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:04,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:05,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:05,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:05,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:05,719 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:25:05,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:05,719 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:25:05,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:05,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:05,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:05,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:05,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:05,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:07,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:07,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:25:07,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:07,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:25:07,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:25:07,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:25:07,447 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 16:25:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:07,514 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 16:25:07,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:25:07,514 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 16:25:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:07,515 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:25:07,515 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:25:07,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:25:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:25:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:25:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:25:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 16:25:07,518 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 16:25:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:07,518 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 16:25:07,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:25:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 16:25:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:25:07,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:07,519 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 16:25:07,519 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:07,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-12-03 16:25:07,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:07,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:07,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:07,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:08,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:08,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:08,224 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:08,224 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:25:08,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:08,224 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:25:08,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:08,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:08,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:08,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:10,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:25:10,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:10,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:25:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:25:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:25:10,364 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 16:25:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:10,458 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 16:25:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:25:10,459 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 16:25:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:10,460 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:25:10,460 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:25:10,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:25:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:25:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:25:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:25:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 16:25:10,462 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 16:25:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:10,462 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 16:25:10,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:25:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 16:25:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:25:10,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:10,463 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 16:25:10,463 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:10,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:10,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-12-03 16:25:10,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:10,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:10,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:10,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:10,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:11,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:11,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:11,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:11,442 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:25:11,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:11,442 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:25:11,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:11,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:11,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:25:11,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:11,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:11,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:13,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:13,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:25:13,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:13,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:25:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:25:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:25:13,606 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 16:25:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:13,758 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 16:25:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:25:13,759 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 16:25:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:13,759 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:25:13,759 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:25:13,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:25:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:25:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:25:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:25:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 16:25:13,761 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 16:25:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:13,762 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 16:25:13,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:25:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 16:25:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:25:13,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:13,762 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 16:25:13,762 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:13,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:13,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-12-03 16:25:13,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:13,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:13,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:14,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:14,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:14,556 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:14,556 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:25:14,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:14,556 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:25:14,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:14,565 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:14,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:14,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:14,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:14,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:16,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:25:16,902 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:16,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:25:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:25:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:25:16,903 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 16:25:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:16,953 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 16:25:16,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:25:16,953 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 16:25:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:16,954 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:25:16,954 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:25:16,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 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:25:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:25:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:25:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:25:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 16:25:16,958 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 16:25:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:16,958 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 16:25:16,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:25:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 16:25:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:25:16,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:16,959 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 16:25:16,960 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:16,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-12-03 16:25:16,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:16,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:16,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:16,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:17,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:17,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:17,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:17,759 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:25:17,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:17,759 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:25:17,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:17,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:17,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:17,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:20,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:20,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:25:20,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:20,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:25:20,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:25:20,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:25:20,347 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 16:25:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:20,494 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 16:25:20,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:25:20,495 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 16:25:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:20,495 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:25:20,495 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:25:20,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:25:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:25:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:25:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:25:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 16:25:20,498 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 16:25:20,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:20,499 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 16:25:20,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:25:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 16:25:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:25:20,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:20,500 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 16:25:20,500 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:20,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:20,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-12-03 16:25:20,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:20,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:20,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:20,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:20,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:21,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:21,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:21,318 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:25:21,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:21,318 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:25:21,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:21,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:21,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:25:21,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:21,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:21,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:23,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:23,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:25:23,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:23,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:25:23,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:25:23,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:25:23,658 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 16:25:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:23,712 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 16:25:23,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:25:23,713 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 16:25:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:23,714 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:25:23,714 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:25:23,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:25:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:25:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:25:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:25:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 16:25:23,718 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 16:25:23,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:23,718 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 16:25:23,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:25:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 16:25:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:25:23,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:23,719 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 16:25:23,719 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:23,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-12-03 16:25:23,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:23,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:23,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:23,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:23,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:24,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:24,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:24,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:24,921 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:25:24,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:24,921 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:25:24,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:24,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:25,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:25,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:25,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:27,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:27,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:25:27,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:27,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:25:27,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:25:27,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:25:27,502 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 16:25:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:27,843 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 16:25:27,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:25:27,843 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 16:25:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:27,844 INFO L225 Difference]: With dead ends: 52 [2018-12-03 16:25:27,844 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:25:27,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:25:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:25:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:25:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:25:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 16:25:27,848 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 16:25:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:27,848 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 16:25:27,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:25:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 16:25:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:25:27,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:27,849 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 16:25:27,849 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:27,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:27,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-12-03 16:25:27,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:27,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:27,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:27,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:27,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:28,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:28,741 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:28,741 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:25:28,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:28,741 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:25:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:28,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:28,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:31,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:31,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:25:31,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:31,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:25:31,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:25:31,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:25:31,500 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 16:25:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:31,592 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 16:25:31,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:25:31,593 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 16:25:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:31,593 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:25:31,594 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:25:31,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:25:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:25:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:25:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:25:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 16:25:31,597 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 16:25:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:31,598 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 16:25:31,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:25:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 16:25:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:25:31,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:31,598 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 16:25:31,598 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:31,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-12-03 16:25:31,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:32,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:32,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:32,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:32,713 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:25:32,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:32,714 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:25:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:32,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:32,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:25:32,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:32,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:32,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:35,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:35,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:25:35,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:35,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:25:35,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:25:35,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:25:35,663 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 16:25:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:35,725 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 16:25:35,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:25:35,725 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 16:25:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:35,727 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:25:35,727 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:25:35,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:25:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:25:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:25:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:25:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 16:25:35,730 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 16:25:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:35,730 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 16:25:35,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:25:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 16:25:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:25:35,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:35,731 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 16:25:35,731 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:35,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-12-03 16:25:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:35,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:35,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:35,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:35,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:36,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:36,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:36,855 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:36,856 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:25:36,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:36,856 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:25:36,865 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:36,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:36,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:36,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:36,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:36,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:39,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:39,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:25:39,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:39,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:25:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:25:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:25:39,981 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 16:25:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:40,135 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 16:25:40,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:25:40,136 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 16:25:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:40,137 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:25:40,137 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:25:40,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:25:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:25:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:25:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:25:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 16:25:40,141 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 16:25:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:40,142 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 16:25:40,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:25:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 16:25:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:25:40,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:40,142 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 16:25:40,142 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:40,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-12-03 16:25:40,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:40,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:40,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:40,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:40,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:41,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:41,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:41,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:41,218 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:25:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:41,218 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:25:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:41,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:41,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:41,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:44,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:44,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:25:44,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:44,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:25:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:25:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:25:44,273 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 16:25:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:44,365 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 16:25:44,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:25:44,366 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 16:25:44,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:44,366 INFO L225 Difference]: With dead ends: 56 [2018-12-03 16:25:44,366 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:25:44,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:25:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:25:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:25:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:25:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 16:25:44,369 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 16:25:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:44,370 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 16:25:44,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:25:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 16:25:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:25:44,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:44,370 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 16:25:44,371 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:44,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-12-03 16:25:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:44,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:44,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:45,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:45,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:45,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:45,503 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:25:45,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:45,503 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:25:45,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:45,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:45,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:25:45,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:45,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:45,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:48,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:48,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 16:25:48,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:48,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:25:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:25:48,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:25:48,626 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 16:25:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:48,811 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 16:25:48,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:25:48,812 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 16:25:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:48,813 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:25:48,813 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:25:48,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:25:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:25:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:25:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:25:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 16:25:48,816 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 16:25:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:48,816 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 16:25:48,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:25:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 16:25:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:25:48,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:48,817 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 16:25:48,817 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:48,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-12-03 16:25:48,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:48,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:48,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:50,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:50,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:50,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:50,588 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:25:50,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:50,588 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:25:50,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:50,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:50,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:50,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:50,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:50,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:53,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:53,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:25:53,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:53,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:25:53,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:25:53,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:25:53,649 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 16:25:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:53,742 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 16:25:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:25:53,742 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 16:25:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:53,743 INFO L225 Difference]: With dead ends: 58 [2018-12-03 16:25:53,743 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:25:53,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:25:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:25:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:25:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:25:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 16:25:53,747 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 16:25:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:53,747 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 16:25:53,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:25:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 16:25:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:25:53,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:53,748 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 16:25:53,748 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:53,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:53,748 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-12-03 16:25:53,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:53,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:53,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:55,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:55,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:55,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:55,209 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:25:55,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:55,209 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:25:55,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:55,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:55,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:55,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:58,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:58,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:25:58,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:58,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:25:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:25:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:25:58,445 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 16:25:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:58,541 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 16:25:58,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:25:58,542 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 16:25:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:58,543 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:25:58,543 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:25:58,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 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:25:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:25:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 16:25:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:25:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 16:25:58,546 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 16:25:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:58,547 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 16:25:58,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:25:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 16:25:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:25:58,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:58,547 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 16:25:58,548 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:58,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-12-03 16:25:58,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:58,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:58,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:00,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:00,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:00,253 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,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,253 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:26:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:00,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:00,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:26:00,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:00,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:00,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:03,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:03,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:26:03,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:03,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:26:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:26:03,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:26:03,368 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 16:26:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:03,438 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 16:26:03,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:26:03,438 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 16:26:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:03,439 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:26:03,439 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:26:03,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:26:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:26:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 16:26:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:26:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 16:26:03,443 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 16:26:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:03,443 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 16:26:03,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:26:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 16:26:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:26:03,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:03,444 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 16:26:03,444 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:03,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:03,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-12-03 16:26:03,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:05,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:05,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:05,877 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,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,877 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:26:05,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:05,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:05,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:05,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:05,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:05,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:09,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:09,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:26:09,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:09,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:26:09,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:26:09,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:26:09,371 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 16:26:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:09,459 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 16:26:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:26:09,460 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 16:26:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:09,460 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:26:09,461 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:26:09,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:26:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:26:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:26:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:26:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 16:26:09,464 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 16:26:09,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:09,465 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 16:26:09,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:26:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 16:26:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:26:09,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:09,465 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 16:26:09,466 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:09,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-12-03 16:26:09,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:09,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:09,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:09,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:09,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:11,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:11,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:11,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:11,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:11,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:11,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 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:26:11,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:11,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:11,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:11,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:15,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:15,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:26:15,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:15,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:26:15,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:26:15,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:26:15,024 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 16:26:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:15,200 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 16:26:15,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:26:15,201 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 16:26:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:15,201 INFO L225 Difference]: With dead ends: 62 [2018-12-03 16:26:15,201 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:26:15,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:26:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:26:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:26:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:26:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 16:26:15,205 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 16:26:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:15,205 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 16:26:15,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:26:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 16:26:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:26:15,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:15,206 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 16:26:15,206 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:15,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:15,206 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-12-03 16:26:15,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:15,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:15,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:15,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:15,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:16,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:16,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:16,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:16,563 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:16,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:16,563 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:26:16,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:16,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:16,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:26:16,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:16,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:16,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:20,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:20,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 16:26:20,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:20,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:26:20,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:26:20,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:26:20,130 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 16:26:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:20,260 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 16:26:20,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:26:20,261 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 16:26:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:20,261 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:26:20,261 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:26:20,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:26:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:26:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:26:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:26:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 16:26:20,264 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 16:26:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:20,264 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 16:26:20,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:26:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 16:26:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:26:20,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:20,265 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 16:26:20,265 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:20,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:20,265 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-12-03 16:26:20,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:20,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:20,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:20,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:20,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:21,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:21,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:21,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:21,919 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,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:21,920 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:26:21,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:21,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:22,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:22,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:22,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:22,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:26:26,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:26,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:26:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:26:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:26:26,870 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 16:26:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:26,972 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 16:26:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:26:26,972 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 16:26:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:26,973 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:26:26,973 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:26:26,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:26:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:26:26,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 16:26:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 16:26:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 16:26:26,977 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 16:26:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:26,978 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 16:26:26,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:26:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 16:26:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 16:26:26,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:26,978 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 16:26:26,978 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:26,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:26,979 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-12-03 16:26:26,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:26,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:26,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:26,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:26,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:28,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:28,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:28,536 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:28,536 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,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:28,536 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:26:28,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:28,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:28,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:28,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:32,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:32,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:26:32,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:32,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:26:32,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:26:32,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:26:32,724 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 16:26:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:32,813 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 16:26:32,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:26:32,814 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 16:26:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:32,814 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:26:32,814 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:26:32,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:26:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:26:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:26:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:26:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 16:26:32,819 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 16:26:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:32,819 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 16:26:32,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:26:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 16:26:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:26:32,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:32,820 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 16:26:32,820 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:32,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-12-03 16:26:32,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:32,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:32,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:32,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:32,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:34,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:34,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:34,177 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:34,177 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:34,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:34,177 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:26:34,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:34,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:34,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:26:34,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:34,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:34,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:38,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:38,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:26:38,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:38,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:26:38,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:26:38,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:26:38,322 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 16:26:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:38,395 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 16:26:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:26:38,395 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 16:26:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:38,396 INFO L225 Difference]: With dead ends: 66 [2018-12-03 16:26:38,396 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:26:38,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:26:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:26:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:26:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:26:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 16:26:38,399 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 16:26:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:38,399 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 16:26:38,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:26:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 16:26:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:26:38,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:38,400 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 16:26:38,400 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:38,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-12-03 16:26:38,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:38,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:38,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:38,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:38,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:39,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:39,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:39,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:39,813 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,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:39,813 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:26:39,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:39,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:39,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:39,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:39,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:39,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:44,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:44,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:26:44,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:44,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:26:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:26:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:26:44,165 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 16:26:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:44,289 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 16:26:44,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:26:44,290 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 16:26:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:44,290 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:26:44,290 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:26:44,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 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:26:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:26:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 16:26:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:26:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 16:26:44,294 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 16:26:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:44,294 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 16:26:44,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:26:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 16:26:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:26:44,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:44,295 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 16:26:44,295 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:44,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-12-03 16:26:44,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:44,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:44,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:45,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:45,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:45,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:45,811 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:45,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:45,811 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:26:45,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:45,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:45,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:45,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:50,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:50,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:26:50,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:50,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:26:50,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:26:50,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:26:50,089 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 16:26:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:50,214 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 16:26:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:26:50,215 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 16:26:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:50,215 INFO L225 Difference]: With dead ends: 68 [2018-12-03 16:26:50,216 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:26:50,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:26:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:26:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:26:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:26:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 16:26:50,219 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 16:26:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:50,219 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 16:26:50,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:26:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 16:26:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:26:50,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:50,220 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 16:26:50,220 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:50,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-12-03 16:26:50,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:50,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:50,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:50,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:50,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:51,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:51,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:51,945 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:51,945 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:51,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:51,946 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:26:51,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:51,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:52,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:26:52,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:52,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:52,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:56,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:56,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:26:56,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:56,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:26:56,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:26:56,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:26:56,744 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 16:26:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:56,857 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 16:26:56,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:26:56,858 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 16:26:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:56,858 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:26:56,858 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:26:56,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:26:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:26:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:26:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:26:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 16:26:56,861 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 16:26:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:56,861 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 16:26:56,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:26:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 16:26:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:26:56,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:56,862 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 16:26:56,862 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:56,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-12-03 16:26:56,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:56,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:56,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:58,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:58,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:58,383 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:58,384 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,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:58,384 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:26:58,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:58,400 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:58,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:58,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:58,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:58,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:03,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:03,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:27:03,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:03,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:27:03,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:27:03,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:27:03,033 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 16:27:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:03,142 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 16:27:03,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:27:03,145 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 16:27:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:03,146 INFO L225 Difference]: With dead ends: 70 [2018-12-03 16:27:03,146 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:27:03,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:27:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:27:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:27:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:27:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 16:27:03,152 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 16:27:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:03,152 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 16:27:03,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:27:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 16:27:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:27:03,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:03,153 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 16:27:03,153 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:03,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-12-03 16:27:03,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:03,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:03,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:03,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:03,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:04,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:04,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:04,783 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:04,783 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:04,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:04,783 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:27:04,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:04,792 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:04,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:04,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:09,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:09,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:27:09,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:09,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:27:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:27:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:27:09,921 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 16:27:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:10,008 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 16:27:10,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:27:10,009 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 16:27:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:10,009 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:27:10,010 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:27:10,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:27:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:27:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:27:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:27:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 16:27:10,014 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 16:27:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:10,015 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 16:27:10,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:27:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 16:27:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:27:10,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:10,015 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 16:27:10,015 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:10,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-12-03 16:27:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:10,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:11,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:11,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:11,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:11,767 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:11,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:11,767 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:27:11,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:11,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:11,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:27:11,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:11,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:11,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:16,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:16,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:27:16,502 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:16,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:27:16,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:27:16,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:27:16,504 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 16:27:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:16,650 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 16:27:16,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:27:16,651 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 16:27:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:16,651 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:27:16,651 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:27:16,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:27:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:27:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 16:27:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:27:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 16:27:16,654 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 16:27:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:16,654 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 16:27:16,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:27:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 16:27:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:27:16,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:16,654 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 16:27:16,655 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:16,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-12-03 16:27:16,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:16,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:16,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:16,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:19,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:19,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:19,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:19,140 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:19,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:19,140 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:27:19,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:19,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:19,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:19,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:19,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:19,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:25,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:25,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:27:25,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:25,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:27:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:27:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:27:25,006 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 16:27:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:25,307 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 16:27:25,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:27:25,308 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 16:27:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:25,309 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:27:25,309 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:27:25,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:27:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:27:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:27:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:27:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 16:27:25,312 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 16:27:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:25,312 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 16:27:25,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:27:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 16:27:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:27:25,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:25,312 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 16:27:25,313 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:25,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:25,313 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-12-03 16:27:25,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:25,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:25,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:25,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:25,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:27,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:27,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:27,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:27,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:27,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:27,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 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:27:27,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:27,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:27,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:27,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:32,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:32,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:27:32,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:32,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:27:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:27:32,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:27:32,733 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 16:27:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:32,822 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 16:27:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:27:32,823 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 16:27:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:32,824 INFO L225 Difference]: With dead ends: 74 [2018-12-03 16:27:32,824 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 16:27:32,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:27:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 16:27:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 16:27:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:27:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 16:27:32,828 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 16:27:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:32,828 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 16:27:32,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:27:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 16:27:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:27:32,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:32,829 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 16:27:32,829 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:32,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:32,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-12-03 16:27:32,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:32,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:32,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:32,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:32,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:34,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:34,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:34,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:34,547 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:34,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:34,547 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:27:34,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:34,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:34,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:27:34,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:34,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:34,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:40,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:40,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 16:27:40,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:40,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:27:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:27:40,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:27:40,021 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 16:27:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:40,220 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 16:27:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:27:40,221 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 16:27:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:40,222 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:27:40,222 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:27:40,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:27:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:27:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:27:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:27:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 16:27:40,225 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 16:27:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:40,225 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 16:27:40,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:27:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 16:27:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:27:40,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:40,226 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 16:27:40,226 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:40,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-12-03 16:27:40,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:40,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:40,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:40,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:40,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:42,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:42,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:42,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:42,043 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:42,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:42,043 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:27:42,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:42,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:42,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:42,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:42,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:42,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:47,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:47,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:27:47,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:47,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:27:47,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:27:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:27:47,591 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 16:27:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:47,751 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 16:27:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:27:47,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 16:27:47,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:47,753 INFO L225 Difference]: With dead ends: 76 [2018-12-03 16:27:47,753 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:27:47,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:27:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:27:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 16:27:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:27:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 16:27:47,758 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 16:27:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:47,758 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 16:27:47,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:27:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 16:27:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:27:47,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:47,759 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 16:27:47,760 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:47,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-12-03 16:27:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:47,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:47,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:50,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:50,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:50,046 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:50,047 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:50,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:50,047 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:27:50,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:50,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:50,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:50,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:55,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:55,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:27:55,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:55,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:27:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:27:55,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:27:55,643 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 16:27:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:55,854 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 16:27:55,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:27:55,855 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 16:27:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:55,856 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:27:55,856 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:27:55,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 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:27:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:27:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:27:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:27:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 16:27:55,860 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 16:27:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:55,861 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 16:27:55,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:27:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 16:27:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:27:55,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:55,862 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 16:27:55,862 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:55,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-12-03 16:27:55,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:55,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:55,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:58,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:58,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:58,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:58,029 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,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:58,029 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:27:58,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:58,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:58,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:27:58,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:58,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:58,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:03,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:28:03,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:03,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:28:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:28:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:28:03,892 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 16:28:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:04,028 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 16:28:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:28:04,029 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 16:28:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:04,030 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:28:04,030 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:28:04,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:28:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:28:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:28:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:28:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 16:28:04,034 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 16:28:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:04,035 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 16:28:04,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:28:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 16:28:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:28:04,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:04,036 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 16:28:04,036 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:04,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-12-03 16:28:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:04,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:04,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:06,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:06,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:06,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:06,080 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:06,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:06,081 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:28:06,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:06,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:06,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:06,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:06,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:06,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:12,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:12,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:28:12,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:12,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:28:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:28:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:28:12,223 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 16:28:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:12,361 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 16:28:12,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:28:12,361 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 16:28:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:12,362 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:28:12,362 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:28:12,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:28:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:28:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:28:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:28:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 16:28:12,365 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 16:28:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:12,366 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 16:28:12,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:28:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 16:28:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:28:12,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:12,366 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 16:28:12,367 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:12,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-12-03 16:28:12,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:12,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:12,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:12,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:14,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:14,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:14,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:14,650 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,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:14,650 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:28:14,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:14,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:14,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:14,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:20,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:20,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:28:20,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:20,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:28:20,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:28:20,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:28:20,883 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 16:28:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:21,019 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 16:28:21,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:28:21,019 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 16:28:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:21,020 INFO L225 Difference]: With dead ends: 80 [2018-12-03 16:28:21,020 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:28:21,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:28:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:28:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:28:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:28:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 16:28:21,023 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 16:28:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:21,023 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 16:28:21,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:28:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 16:28:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:28:21,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:21,023 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 16:28:21,024 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:21,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-12-03 16:28:21,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:21,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:21,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:21,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:23,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:23,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:23,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:23,150 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:23,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:23,150 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:28:23,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:23,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:23,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:28:23,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:23,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:23,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:29,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:29,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:28:29,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:29,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:28:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:28:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:28:29,677 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 16:28:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:29,783 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 16:28:29,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:28:29,783 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 16:28:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:29,784 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:28:29,784 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:28:29,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:28:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:28:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:28:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:28:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 16:28:29,789 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 16:28:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:29,789 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 16:28:29,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:28:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 16:28:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:28:29,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:29,790 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 16:28:29,791 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:29,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-12-03 16:28:29,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:29,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:29,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:29,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:29,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:31,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:31,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:31,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:31,934 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:31,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:31,934 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:28:31,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:31,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:32,052 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:32,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:32,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:32,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:38,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:38,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:28:38,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:38,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:28:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:28:38,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:28:38,660 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 16:28:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:38,837 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 16:28:38,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:28:38,837 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 16:28:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:38,838 INFO L225 Difference]: With dead ends: 82 [2018-12-03 16:28:38,838 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:28:38,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:28:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:28:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 16:28:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:28:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 16:28:38,843 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 16:28:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:38,843 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 16:28:38,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:28:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 16:28:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:28:38,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:38,843 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 16:28:38,844 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:38,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:38,844 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-12-03 16:28:38,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:38,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:38,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:38,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:38,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:41,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:41,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:41,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:41,007 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:41,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:41,008 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:28:41,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:41,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:41,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:41,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:47,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:47,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:28:47,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:47,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:28:47,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:28:47,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:28:47,586 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 16:28:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:47,957 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 16:28:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:28:47,958 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 16:28:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:47,958 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:28:47,959 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:28:47,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:28:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:28:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:28:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:28:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 16:28:47,962 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 16:28:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:47,962 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 16:28:47,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:28:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 16:28:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:28:47,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:47,963 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 16:28:47,963 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:47,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:47,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-12-03 16:28:47,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:47,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:50,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:50,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:50,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:50,553 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:50,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:50,553 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:28:50,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:50,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:50,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:28:50,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:50,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:50,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:57,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:57,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:28:57,476 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:57,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:28:57,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:28:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:28:57,478 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 16:28:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:58,089 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 16:28:58,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:28:58,089 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 16:28:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:58,090 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:28:58,090 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:28:58,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:28:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:28:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 16:28:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:28:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 16:28:58,094 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 16:28:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:58,094 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 16:28:58,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:28:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 16:28:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:28:58,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:58,095 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 16:28:58,095 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:58,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-12-03 16:28:58,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:58,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:58,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:58,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:58,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:00,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:00,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:00,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:00,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:29:00,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:00,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 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:29:00,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:00,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:00,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:00,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:00,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:00,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:07,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:07,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:29:07,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:07,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:29:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:29:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:29:07,636 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 16:29:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:07,779 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 16:29:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:29:07,780 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 16:29:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:07,781 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:29:07,781 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:29:07,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:29:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:29:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:29:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:29:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 16:29:07,785 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 16:29:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:07,785 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 16:29:07,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:29:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 16:29:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:29:07,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:07,786 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 16:29:07,786 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:07,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-12-03 16:29:07,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:07,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:07,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:07,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:07,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:10,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:10,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:10,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:10,475 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:10,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:10,475 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:29:10,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:10,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:10,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:10,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:17,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:17,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:29:17,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:17,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:29:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:29:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:29:17,451 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 16:29:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:17,570 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 16:29:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:29:17,570 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 16:29:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:17,571 INFO L225 Difference]: With dead ends: 86 [2018-12-03 16:29:17,571 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:29:17,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:29:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:29:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:29:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:29:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 16:29:17,573 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 16:29:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:17,573 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 16:29:17,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:29:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 16:29:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:29:17,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:17,574 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 16:29:17,574 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:17,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:17,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-12-03 16:29:17,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:17,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:17,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:20,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:20,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:20,354 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:20,354 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,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:20,354 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:29:20,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:20,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:20,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 16:29:20,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:20,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:20,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:27,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:27,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 16:29:27,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:27,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:29:27,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:29:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:29:27,626 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 16:29:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:27,828 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 16:29:27,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:29:27,829 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 16:29:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:27,829 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:29:27,830 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:29:27,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:29:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:29:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:29:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:29:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 16:29:27,833 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 16:29:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:27,833 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 16:29:27,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:29:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 16:29:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:29:27,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:27,834 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 16:29:27,834 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:27,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-12-03 16:29:27,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:27,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:27,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:27,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:27,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:30,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:30,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:30,508 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:30,508 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:30,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:30,508 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:29:30,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:30,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:30,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:30,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:30,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:30,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:37,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:37,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 16:29:37,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:37,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:29:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:29:37,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:29:37,882 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 16:29:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:38,048 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 16:29:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:29:38,048 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 16:29:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:38,049 INFO L225 Difference]: With dead ends: 88 [2018-12-03 16:29:38,049 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:29:38,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:29:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:29:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:29:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:29:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 16:29:38,052 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 16:29:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:38,053 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 16:29:38,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:29:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 16:29:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:29:38,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:38,054 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 16:29:38,054 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:38,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-12-03 16:29:38,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:38,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:38,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:38,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:38,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:40,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:40,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:40,907 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:40,907 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:40,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:40,907 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:29:40,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:40,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:41,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:41,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:48,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:48,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 16:29:48,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:48,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:29:48,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:29:48,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:29:48,627 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 16:29:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:48,851 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 16:29:48,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:29:48,851 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 16:29:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:48,852 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:29:48,852 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:29:48,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 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:29:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:29:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:29:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:29:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 16:29:48,856 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 16:29:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:48,856 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 16:29:48,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:29:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 16:29:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:29:48,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:48,857 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 16:29:48,857 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:48,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-12-03 16:29:48,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:48,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:48,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:48,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:48,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:51,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:51,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:51,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:51,925 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:51,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:51,925 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:29:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:51,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:52,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:29:52,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:52,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:52,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:59,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:59,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 16:29:59,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:59,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:29:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:29:59,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:29:59,673 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 16:29:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:59,813 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 16:29:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:29:59,813 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 16:29:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:59,814 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:29:59,814 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:29:59,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:29:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:29:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:29:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:29:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 16:29:59,818 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 16:29:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:59,818 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 16:29:59,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:29:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 16:29:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:29:59,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:59,819 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 16:29:59,819 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:59,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-12-03 16:29:59,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:59,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:59,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:59,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:59,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:02,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:02,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:02,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:02,612 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:02,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:02,612 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:30:02,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:02,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:02,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:02,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:02,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:02,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:10,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:10,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 16:30:10,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:10,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 16:30:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 16:30:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:30:10,563 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 16:30:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:10,786 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 16:30:10,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:30:10,786 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 16:30:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:10,787 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:30:10,787 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:30:10,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:30:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:30:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:30:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:30:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 16:30:10,790 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 16:30:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:10,790 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 16:30:10,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 16:30:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 16:30:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:30:10,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:10,791 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 16:30:10,792 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:10,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:10,792 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-12-03 16:30:10,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:10,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:10,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:10,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:10,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:13,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:13,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:13,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:13,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:13,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:13,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 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:30:13,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:13,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:13,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:13,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:22,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:22,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:30:22,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:22,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:30:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:30:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:30:22,042 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 16:30:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:22,398 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 16:30:22,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:30:22,398 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 16:30:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:22,399 INFO L225 Difference]: With dead ends: 92 [2018-12-03 16:30:22,399 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:30:22,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 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:30:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:30:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:30:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:30:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 16:30:22,404 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 16:30:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:22,404 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 16:30:22,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:30:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 16:30:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:30:22,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:22,405 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 16:30:22,405 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:22,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:22,405 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-12-03 16:30:22,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:22,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:22,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:22,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:22,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:25,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:25,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:25,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:25,205 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,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:25,205 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:30:25,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:25,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:25,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 16:30:25,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:25,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:25,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:34,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:34,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 16:30:34,179 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:34,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:30:34,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:30:34,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:30:34,182 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 16:30:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:34,388 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 16:30:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:30:34,389 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 16:30:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:34,390 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:30:34,390 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:30:34,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:30:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:30:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:30:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:30:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 16:30:34,393 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 16:30:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:34,394 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 16:30:34,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:30:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 16:30:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:30:34,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:34,394 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 16:30:34,394 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:34,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-12-03 16:30:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:34,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:34,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:34,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:34,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:37,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:37,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:37,434 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:37,434 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:37,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:37,435 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:30:37,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:37,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:37,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:37,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:37,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:37,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:45,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:45,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:30:45,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:45,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:30:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:30:45,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:30:45,984 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 16:30:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:46,110 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 16:30:46,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:30:46,111 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 16:30:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:46,112 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:30:46,112 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:30:46,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:30:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:30:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:30:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:30:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 16:30:46,116 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 16:30:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:46,116 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 16:30:46,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:30:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 16:30:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:30:46,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:46,117 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 16:30:46,117 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:46,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-12-03 16:30:46,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:46,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:46,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:49,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:49,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:49,164 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:49,164 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:49,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:49,164 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:30:49,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:49,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:49,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:49,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:58,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:30:58,020 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:58,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:30:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:30:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:30:58,022 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 16:30:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:58,231 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 16:30:58,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:30:58,231 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 16:30:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:58,232 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:30:58,232 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:30:58,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:30:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:30:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:30:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:30:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 16:30:58,237 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 16:30:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:58,237 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 16:30:58,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:30:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 16:30:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:30:58,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:58,237 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 16:30:58,237 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:58,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:58,238 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-12-03 16:30:58,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:58,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:58,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:58,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:58,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:01,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:01,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:01,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:01,169 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:01,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:01,169 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:31:01,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:01,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:01,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:31:01,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:01,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:01,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:10,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:10,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 16:31:10,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:10,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:31:10,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:31:10,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:31:10,362 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 16:31:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:10,510 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 16:31:10,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:31:10,511 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 16:31:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:10,511 INFO L225 Difference]: With dead ends: 96 [2018-12-03 16:31:10,511 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:31:10,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:31:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:31:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:31:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:31:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 16:31:10,514 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 16:31:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:10,514 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 16:31:10,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:31:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 16:31:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:31:10,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:10,515 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 16:31:10,515 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:10,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:10,515 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-12-03 16:31:10,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:10,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:10,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:10,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:13,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:13,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:13,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:13,781 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:13,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:13,782 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:31:13,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:13,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:13,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:13,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:13,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:13,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:23,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:23,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 16:31:23,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:23,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:31:23,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:31:23,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:31:23,263 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 16:31:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:23,505 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 16:31:23,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:31:23,505 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 16:31:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:23,506 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:31:23,506 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:31:23,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:31:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:31:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:31:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:31:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 16:31:23,511 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 16:31:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:23,511 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 16:31:23,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:31:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 16:31:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:31:23,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:23,512 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 16:31:23,512 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:23,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:23,512 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-12-03 16:31:23,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:23,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:23,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:23,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:23,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:26,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:26,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:26,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:26,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:31:26,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:26,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 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:31:26,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:26,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:26,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:26,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:36,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:36,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 16:31:36,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:36,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:31:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:31:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:31:36,182 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 16:31:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:36,368 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 16:31:36,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:31:36,368 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 16:31:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:36,369 INFO L225 Difference]: With dead ends: 98 [2018-12-03 16:31:36,369 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:31:36,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 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:31:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:31:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:31:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:31:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 16:31:36,373 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 16:31:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:36,373 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 16:31:36,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:31:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 16:31:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:31:36,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:36,374 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 16:31:36,374 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:36,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-12-03 16:31:36,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:36,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:36,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:36,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:39,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:39,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:39,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:39,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:31:39,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:39,745 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:31:39,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:39,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:39,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 16:31:39,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:39,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:39,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:49,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:49,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 16:31:49,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:49,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:31:49,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:31:49,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:31:49,614 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 16:31:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:49,764 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 16:31:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:31:49,765 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 16:31:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:49,766 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:31:49,766 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:31:49,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:31:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:31:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:31:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:31:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 16:31:49,770 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 16:31:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:49,770 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 16:31:49,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:31:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 16:31:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:31:49,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:49,771 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 16:31:49,771 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:49,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-12-03 16:31:49,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:49,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:49,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:52,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:52,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:52,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:52,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:31:52,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:52,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 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:31:52,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:52,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:53,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:53,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:53,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:53,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:02,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:02,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 16:32:02,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:02,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:32:02,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:32:02,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:32:02,884 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 16:32:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:03,018 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 16:32:03,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:32:03,019 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 16:32:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:03,019 INFO L225 Difference]: With dead ends: 100 [2018-12-03 16:32:03,020 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:32:03,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:32:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:32:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:32:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:32:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 16:32:03,024 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 16:32:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:03,024 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 16:32:03,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:32:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 16:32:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:32:03,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:03,025 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 16:32:03,025 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:03,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-12-03 16:32:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:03,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:03,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:06,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:06,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:06,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:06,477 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:06,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:06,477 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:32:06,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:06,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:06,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:06,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:16,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:16,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 16:32:16,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:16,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:32:16,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:32:16,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:32:16,694 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 16:32:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:16,837 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 16:32:16,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:32:16,838 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 16:32:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:16,839 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:32:16,839 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:32:16,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 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:32:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:32:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:32:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:32:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 16:32:16,843 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 16:32:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:16,843 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 16:32:16,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:32:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 16:32:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:32:16,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:16,844 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 16:32:16,844 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:16,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2018-12-03 16:32:16,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:16,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:16,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:20,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:20,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:20,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:20,441 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:20,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:20,442 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:32:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:20,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:20,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:32:20,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:20,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:20,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:30,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:30,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 16:32:30,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:30,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:32:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:32:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:32:30,717 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 16:32:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:30,883 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 16:32:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:32:30,884 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 16:32:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:30,885 INFO L225 Difference]: With dead ends: 102 [2018-12-03 16:32:30,885 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:32:30,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:32:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:32:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:32:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:32:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 16:32:30,889 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 16:32:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:30,889 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 16:32:30,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:32:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 16:32:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:32:30,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:30,890 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 16:32:30,891 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2018-12-03 16:32:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:30,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:30,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:30,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:30,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:34,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:34,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:34,600 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:34,600 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:34,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:34,601 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:32:34,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:34,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:34,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:34,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:34,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:34,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:45,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:45,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 16:32:45,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:45,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 16:32:45,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 16:32:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:32:45,218 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 16:32:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:45,432 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 16:32:45,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:32:45,432 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 16:32:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:45,434 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:32:45,434 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:32:45,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:32:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:32:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:32:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:32:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 16:32:45,438 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 16:32:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:45,438 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 16:32:45,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 16:32:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 16:32:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:32:45,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:45,439 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 16:32:45,439 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:45,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2018-12-03 16:32:45,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:45,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:45,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:48,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:48,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:48,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:48,927 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:48,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:48,927 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:32:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:48,935 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:49,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:49,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:59,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:59,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 16:32:59,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:59,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:32:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:32:59,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:32:59,649 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 16:32:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:59,981 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 16:32:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:32:59,982 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 16:32:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:59,983 INFO L225 Difference]: With dead ends: 104 [2018-12-03 16:32:59,983 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:32:59,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:32:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:32:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:32:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:32:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 16:32:59,987 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 16:32:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:59,988 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 16:32:59,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:32:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 16:32:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:32:59,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:59,988 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 16:32:59,988 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:59,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:59,989 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2018-12-03 16:32:59,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:59,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:59,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:59,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:59,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:03,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:03,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:03,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:03,429 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:03,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:03,429 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:33:03,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:33:03,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:33:03,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 16:33:03,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:03,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:03,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:14,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:14,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 16:33:14,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:14,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:33:14,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:33:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:33:14,371 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 16:33:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:14,608 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 16:33:14,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:33:14,609 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 16:33:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:14,610 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:33:14,610 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:33:14,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:33:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:33:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:33:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:33:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 16:33:14,614 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 16:33:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:14,614 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 16:33:14,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:33:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 16:33:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:33:14,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:14,614 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 16:33:14,615 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:14,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2018-12-03 16:33:14,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:14,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:14,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:14,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:14,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:18,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:18,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:18,458 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:18,458 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:18,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:18,458 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:33:18,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:18,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:18,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:18,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:18,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:18,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:29,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:29,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 16:33:29,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:29,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:33:29,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:33:29,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:33:29,546 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 16:33:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:29,821 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 16:33:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:33:29,822 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 16:33:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:29,822 INFO L225 Difference]: With dead ends: 106 [2018-12-03 16:33:29,822 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:33:29,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:33:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:33:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:33:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:33:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 16:33:29,826 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 16:33:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:29,827 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 16:33:29,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:33:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 16:33:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:33:29,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:29,828 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 16:33:29,828 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:29,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:29,828 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2018-12-03 16:33:29,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:29,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:29,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:29,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:29,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:33,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:33,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:33,761 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:33,761 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:33,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:33,761 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:33:33,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:33,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:33:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:33,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:33,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:45,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:45,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 16:33:45,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:45,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 16:33:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 16:33:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:33:45,061 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 16:33:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:45,254 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 16:33:45,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:33:45,254 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 16:33:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:45,255 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:33:45,256 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:33:45,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:33:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:33:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:33:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:33:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 16:33:45,260 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 16:33:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:45,261 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 16:33:45,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 16:33:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 16:33:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:33:45,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:45,262 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 16:33:45,262 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:45,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:45,262 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2018-12-03 16:33:45,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:45,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:45,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:45,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:45,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:49,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:49,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:49,342 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:49,343 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:49,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:49,343 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:33:49,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:33:49,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:33:49,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:33:49,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:49,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:49,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:00,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:00,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 16:34:00,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:00,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:34:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:34:00,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:34:00,978 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 16:34:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:01,338 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 16:34:01,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:34:01,339 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 16:34:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:01,340 INFO L225 Difference]: With dead ends: 108 [2018-12-03 16:34:01,340 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:34:01,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 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:34:01,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:34:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:34:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:34:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 16:34:01,344 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 16:34:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:01,344 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 16:34:01,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:34:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 16:34:01,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:34:01,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:01,345 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 16:34:01,345 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:01,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:01,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2018-12-03 16:34:01,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:01,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:01,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:01,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:01,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:05,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:05,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:05,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:05,422 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:05,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:05,422 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:34:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:34:05,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:34:05,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:34:05,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:05,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:05,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:17,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:17,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 16:34:17,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:17,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 16:34:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 16:34:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:34:17,624 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 16:34:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:17,897 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 16:34:17,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:34:17,898 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 16:34:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:17,898 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:34:17,898 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:34:17,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 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:34:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:34:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:34:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:34:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 16:34:17,902 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 16:34:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:17,903 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 16:34:17,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 16:34:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 16:34:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:34:17,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:17,904 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 16:34:17,904 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:17,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2018-12-03 16:34:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:17,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:17,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:17,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:17,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:22,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:22,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:22,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:22,144 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,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:22,144 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:34:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:22,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:34:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:22,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:22,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:34,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:34,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 16:34:34,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:34,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:34:34,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:34:34,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:34:34,282 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 16:34:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:34,513 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 16:34:34,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 16:34:34,517 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 16:34:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:34,517 INFO L225 Difference]: With dead ends: 110 [2018-12-03 16:34:34,518 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:34:34,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:34:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:34:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:34:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:34:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 16:34:34,522 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 16:34:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:34,522 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 16:34:34,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:34:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 16:34:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:34:34,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:34,523 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 16:34:34,523 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:34,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2018-12-03 16:34:34,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:34,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:34,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:38,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:38,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:38,679 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:38,679 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:38,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:38,680 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:38,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:38,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:38,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 16:34:38,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:38,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:38,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:51,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:51,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 16:34:51,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:51,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 16:34:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 16:34:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:34:51,166 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 16:34:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:51,395 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 16:34:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:34:51,395 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 16:34:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:51,396 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:34:51,396 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:34:51,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:34:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:34:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:34:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:34:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 16:34:51,400 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 16:34:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:51,400 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 16:34:51,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 16:34:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 16:34:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:34:51,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:51,401 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 16:34:51,401 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:51,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2018-12-03 16:34:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:51,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:51,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:55,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:55,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:55,656 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:55,656 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:55,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:55,656 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:55,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:34:55,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:34:55,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:34:55,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:55,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:55,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:08,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 16:35:08,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:08,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:35:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:35:08,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:35:08,547 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 16:35:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:08,781 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 16:35:08,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 16:35:08,782 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 16:35:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:08,782 INFO L225 Difference]: With dead ends: 112 [2018-12-03 16:35:08,783 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:35:08,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:35:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:35:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:35:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:35:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 16:35:08,787 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 16:35:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:08,787 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 16:35:08,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:35:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 16:35:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 16:35:08,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:08,788 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 16:35:08,788 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:08,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2018-12-03 16:35:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:08,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:08,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:08,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:08,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:13,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:13,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:13,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:13,149 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:13,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:13,149 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:13,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:13,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:35:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:13,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:13,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:25,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:25,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 16:35:25,725 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:25,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 16:35:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 16:35:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:35:25,727 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 16:35:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:25,989 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 16:35:25,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 16:35:25,990 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 16:35:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:25,991 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:35:25,991 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:35:25,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:35:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:35:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:35:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:35:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 16:35:25,996 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 16:35:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:25,996 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 16:35:25,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 16:35:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 16:35:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:35:25,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:25,997 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 16:35:25,997 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:25,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2018-12-03 16:35:25,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:25,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:25,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:30,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:30,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:30,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:30,492 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:30,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:30,492 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:30,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:35:30,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:35:30,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 16:35:30,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:30,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:30,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:43,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:43,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 16:35:43,823 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:43,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:35:43,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:35:43,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:35:43,826 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 16:35:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:44,158 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 16:35:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:35:44,158 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 16:35:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:44,159 INFO L225 Difference]: With dead ends: 114 [2018-12-03 16:35:44,159 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:35:44,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:35:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:35:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:35:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:35:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 16:35:44,164 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 16:35:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:44,164 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 16:35:44,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:35:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 16:35:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:35:44,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:44,164 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 16:35:44,165 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:44,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2018-12-03 16:35:44,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:44,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:44,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:44,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:44,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:48,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:48,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:48,377 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:48,377 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:48,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:48,377 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:48,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:35:48,385 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:35:48,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:35:48,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:48,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:48,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:01,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:01,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 16:36:01,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:01,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 16:36:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 16:36:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:36:01,548 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 16:36:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:01,818 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 16:36:01,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 16:36:01,825 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 16:36:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:01,825 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:36:01,825 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:36:01,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:36:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:36:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 16:36:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:36:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 16:36:01,830 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 16:36:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:01,830 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 16:36:01,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 16:36:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 16:36:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:36:01,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:01,831 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 16:36:01,831 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:01,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2018-12-03 16:36:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:01,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:01,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:06,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:06,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:06,372 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:06,373 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:06,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:06,373 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:06,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:06,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:36:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:06,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:06,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:20,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:20,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 16:36:20,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:20,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:36:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:36:20,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:36:20,076 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 16:36:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:20,302 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 16:36:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 16:36:20,303 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 16:36:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:20,304 INFO L225 Difference]: With dead ends: 116 [2018-12-03 16:36:20,304 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:36:20,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:36:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:36:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 16:36:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:36:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 16:36:20,309 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 16:36:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:20,309 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 16:36:20,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:36:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 16:36:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:36:20,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:20,310 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 16:36:20,310 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:20,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:20,310 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2018-12-03 16:36:20,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:20,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:20,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:20,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:20,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:24,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:24,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:24,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:24,997 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:24,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:24,997 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:25,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:36:25,005 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:36:25,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 16:36:25,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:25,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:25,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:38,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:38,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-03 16:36:38,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:38,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 16:36:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 16:36:38,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:36:38,806 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-03 16:36:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:39,174 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 16:36:39,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 16:36:39,175 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 16:36:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:39,175 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:36:39,175 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:36:39,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:36:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:36:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:36:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:36:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 16:36:39,181 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-03 16:36:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:39,181 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 16:36:39,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 16:36:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 16:36:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:36:39,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:39,182 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-03 16:36:39,182 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:39,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 111 times [2018-12-03 16:36:39,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:39,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:39,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:39,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:39,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat