java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:36:53,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:36:53,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:36:53,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:36:53,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:36:53,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:36:53,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:36:53,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:36:53,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:36:53,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:36:53,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:36:53,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:36:53,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:36:53,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:36:53,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:36:53,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:36:53,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:36:53,918 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:36:53,920 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:36:53,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:36:53,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:36:53,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:36:53,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:36:53,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:36:53,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:36:53,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:36:53,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:36:53,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:36:53,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:36:53,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:36:53,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:36:53,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:36:53,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:36:53,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:36:53,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:36:53,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:36:53,941 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:36:53,963 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:36:53,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:36:53,965 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:36:53,965 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:36:53,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:36:53,966 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:36:53,966 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:36:53,966 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:36:53,966 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:36:53,966 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:36:53,968 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:36:53,968 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:36:53,968 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:36:53,968 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:36:53,969 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:36:53,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:36:53,969 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:36:53,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:36:53,970 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:36:53,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:36:53,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:36:53,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:36:53,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:36:53,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:36:53,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:36:53,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:36:53,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:36:53,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:36:53,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:36:53,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:36:53,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:36:53,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:36:53,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:36:53,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:36:53,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:36:53,975 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:36:53,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:36:53,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:36:53,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:36:53,976 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:36:54,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:36:54,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:36:54,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:36:54,030 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:36:54,031 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:36:54,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2018-12-03 19:36:54,032 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2018-12-03 19:36:54,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:36:54,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:36:54,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:36:54,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:36:54,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:36:54,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,102 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 19:36:54,102 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 19:36:54,102 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 19:36:54,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:36:54,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:36:54,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:36:54,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:36:54,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/1) ... [2018-12-03 19:36:54,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:36:54,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:36:54,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:36:54,127 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:36:54,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (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 19:36:54,195 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 19:36:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 19:36:54,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 19:36:54,383 INFO L272 CfgBuilder]: Using library mode [2018-12-03 19:36:54,383 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:36:54,384 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:54 BoogieIcfgContainer [2018-12-03 19:36:54,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:36:54,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:36:54,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:36:54,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:36:54,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:54" (1/2) ... [2018-12-03 19:36:54,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1052f0d5 and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:36:54, skipping insertion in model container [2018-12-03 19:36:54,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:54" (2/2) ... [2018-12-03 19:36:54,392 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2018-12-03 19:36:54,403 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:36:54,411 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:36:54,430 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:36:54,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:36:54,473 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:36:54,473 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:36:54,473 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:36:54,473 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:36:54,473 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:36:54,475 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:36:54,476 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:36:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 19:36:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-03 19:36:54,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:54,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-03 19:36:54,505 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:54,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:54,512 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-12-03 19:36:54,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:54,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:54,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:54,663 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 19:36:54,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:36:54,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 19:36:54,665 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:36:54,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:36:54,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:36:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:36:54,683 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 19:36:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:54,741 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 19:36:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:36:54,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-03 19:36:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:54,755 INFO L225 Difference]: With dead ends: 9 [2018-12-03 19:36:54,755 INFO L226 Difference]: Without dead ends: 4 [2018-12-03 19:36:54,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 19:36:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-12-03 19:36:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-12-03 19:36:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-03 19:36:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-03 19:36:54,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-12-03 19:36:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:54,806 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-12-03 19:36:54,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:36:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-03 19:36:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 19:36:54,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:54,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 19:36:54,807 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:54,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-12-03 19:36:54,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:54,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:54,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:54,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:54,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:54,959 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 19:36:54,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:54,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:54,961 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-03 19:36:54,963 INFO L205 CegarAbsIntRunner]: [0], [4], [6] [2018-12-03 19:36:55,024 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:36:55,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:36:55,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:36:55,253 INFO L272 AbstractInterpreter]: Visited 3 different actions 25 times. Merged at 2 different actions 16 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 19:36:55,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:55,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:36:55,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:55,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:36:55,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:55,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:55,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:55,533 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 19:36:55,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:55,584 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 19:36:55,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:55,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2018-12-03 19:36:55,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:55,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 19:36:55,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 19:36:55,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 19:36:55,607 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 5 states. [2018-12-03 19:36:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:55,636 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-03 19:36:55,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 19:36:55,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2018-12-03 19:36:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:55,637 INFO L225 Difference]: With dead ends: 6 [2018-12-03 19:36:55,637 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 19:36:55,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 19:36:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 19:36:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 19:36:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 19:36:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 19:36:55,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 19:36:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:55,641 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 19:36:55,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 19:36:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 19:36:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 19:36:55,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:55,642 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-12-03 19:36:55,642 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:55,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-12-03 19:36:55,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:55,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:55,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:55,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:55,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:55,717 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 19:36:55,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:55,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:55,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:55,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 19:36:55,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:55,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 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 19:36:55,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:55,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:55,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 19:36:55,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:55,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:55,830 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 19:36:55,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:56,128 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 19:36:56,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:56,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-03 19:36:56,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:56,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 19:36:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 19:36:56,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:36:56,149 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-12-03 19:36:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:56,177 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-03 19:36:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:36:56,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-12-03 19:36:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:56,178 INFO L225 Difference]: With dead ends: 7 [2018-12-03 19:36:56,178 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 19:36:56,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:36:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 19:36:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 19:36:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 19:36:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 19:36:56,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 19:36:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:56,185 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 19:36:56,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 19:36:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 19:36:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 19:36:56,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:56,186 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-12-03 19:36:56,186 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:56,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-12-03 19:36:56,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:56,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:56,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:56,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:56,289 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 19:36:56,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:56,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:56,292 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:56,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:56,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:56,293 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 19:36:56,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:56,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:56,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:56,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:56,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:56,475 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 19:36:56,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:56,633 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 19:36:56,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:56,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-03 19:36:56,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:56,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 19:36:56,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 19:36:56,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-03 19:36:56,655 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-12-03 19:36:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:56,718 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 19:36:56,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 19:36:56,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-03 19:36:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:56,719 INFO L225 Difference]: With dead ends: 8 [2018-12-03 19:36:56,719 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 19:36:56,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-03 19:36:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 19:36:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 19:36:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 19:36:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 19:36:56,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 19:36:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:56,723 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 19:36:56,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 19:36:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 19:36:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 19:36:56,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:56,724 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-12-03 19:36:56,724 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:56,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-12-03 19:36:56,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:56,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:56,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:56,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:56,821 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 19:36:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:56,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:56,822 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:56,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:56,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:56,823 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 19:36:56,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:56,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:56,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:57,026 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 19:36:57,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:57,455 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 19:36:57,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:57,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-03 19:36:57,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:57,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 19:36:57,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 19:36:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-12-03 19:36:57,478 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 11 states. [2018-12-03 19:36:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:57,533 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 19:36:57,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 19:36:57,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-03 19:36:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:57,535 INFO L225 Difference]: With dead ends: 9 [2018-12-03 19:36:57,535 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 19:36:57,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-12-03 19:36:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 19:36:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 19:36:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 19:36:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 19:36:57,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 19:36:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:57,540 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 19:36:57,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 19:36:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 19:36:57,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 19:36:57,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:57,541 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-12-03 19:36:57,541 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:57,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:57,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-12-03 19:36:57,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:57,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:57,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:57,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:57,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:57,715 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 19:36:57,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:57,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:57,716 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:57,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:57,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:57,716 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 19:36:57,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:57,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:57,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 19:36:57,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:57,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:57,901 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 19:36:57,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:58,027 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 19:36:58,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:58,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-03 19:36:58,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:58,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 19:36:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 19:36:58,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-12-03 19:36:58,048 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2018-12-03 19:36:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:58,142 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 19:36:58,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 19:36:58,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2018-12-03 19:36:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:58,143 INFO L225 Difference]: With dead ends: 10 [2018-12-03 19:36:58,143 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 19:36:58,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-12-03 19:36:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 19:36:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 19:36:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 19:36:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 19:36:58,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 19:36:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:58,148 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 19:36:58,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 19:36:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 19:36:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 19:36:58,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:58,149 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-12-03 19:36:58,149 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:58,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-12-03 19:36:58,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:58,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:58,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:58,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:58,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:58,365 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 19:36:58,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:58,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:58,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:58,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:58,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:58,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:36:58,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:58,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:58,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:58,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:58,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:58,643 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 19:36:58,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:58,808 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 19:36:58,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:58,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2018-12-03 19:36:58,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:58,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 19:36:58,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 19:36:58,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:36:58,830 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 15 states. [2018-12-03 19:36:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:58,926 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 19:36:58,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 19:36:58,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2018-12-03 19:36:58,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:58,928 INFO L225 Difference]: With dead ends: 11 [2018-12-03 19:36:58,928 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 19:36:58,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:36:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 19:36:58,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 19:36:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 19:36:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 19:36:58,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 19:36:58,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:58,933 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 19:36:58,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 19:36:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 19:36:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 19:36:58,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:58,934 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-12-03 19:36:58,934 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:58,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-12-03 19:36:58,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:58,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:58,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:59,215 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 19:36:59,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:59,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:59,216 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:59,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:59,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:59,216 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 19:36:59,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:59,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:59,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:59,894 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 19:36:59,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:00,052 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 19:37:00,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:00,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2018-12-03 19:37:00,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:00,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 19:37:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 19:37:00,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-12-03 19:37:00,074 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 17 states. [2018-12-03 19:37:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:00,195 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 19:37:00,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 19:37:00,195 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 9 [2018-12-03 19:37:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:00,196 INFO L225 Difference]: With dead ends: 12 [2018-12-03 19:37:00,196 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 19:37:00,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-12-03 19:37:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 19:37:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 19:37:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 19:37:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 19:37:00,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 19:37:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:00,201 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 19:37:00,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 19:37:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 19:37:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 19:37:00,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:00,202 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-12-03 19:37:00,202 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:00,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-12-03 19:37:00,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:00,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:00,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:00,447 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 19:37:00,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:00,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:00,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:00,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:00,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:00,449 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 19:37:00,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:00,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:00,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 19:37:00,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:00,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:00,717 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 19:37:00,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:01,330 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 19:37:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:01,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2018-12-03 19:37:01,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:01,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 19:37:01,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 19:37:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2018-12-03 19:37:01,354 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 19 states. [2018-12-03 19:37:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:01,487 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 19:37:01,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 19:37:01,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 10 [2018-12-03 19:37:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:01,489 INFO L225 Difference]: With dead ends: 13 [2018-12-03 19:37:01,489 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 19:37:01,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2018-12-03 19:37:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 19:37:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 19:37:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 19:37:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 19:37:01,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 19:37:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:01,495 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 19:37:01,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 19:37:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 19:37:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 19:37:01,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:01,496 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-12-03 19:37:01,497 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:01,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-12-03 19:37:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:01,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:01,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:01,910 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 19:37:01,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:01,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:01,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:01,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:01,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:01,912 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 19:37:01,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:01,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:01,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:01,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:01,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:02,338 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 19:37:02,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:02,641 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 19:37:02,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:02,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2018-12-03 19:37:02,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:02,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 19:37:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 19:37:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-12-03 19:37:02,663 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 21 states. [2018-12-03 19:37:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:02,805 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 19:37:02,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 19:37:02,805 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 11 [2018-12-03 19:37:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:02,806 INFO L225 Difference]: With dead ends: 14 [2018-12-03 19:37:02,806 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 19:37:02,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-12-03 19:37:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 19:37:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 19:37:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 19:37:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 19:37:02,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 19:37:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:02,811 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 19:37:02,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 19:37:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 19:37:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 19:37:02,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:02,812 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-12-03 19:37:02,812 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:02,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:02,813 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-12-03 19:37:02,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:02,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:02,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:02,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:02,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:03,159 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 19:37:03,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:03,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:03,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:03,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:03,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:03,161 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 19:37:03,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:03,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:03,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:03,734 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 19:37:03,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:04,264 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 19:37:04,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:04,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2018-12-03 19:37:04,285 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:04,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 19:37:04,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 19:37:04,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 19:37:04,286 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 23 states. [2018-12-03 19:37:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:04,853 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 19:37:04,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 19:37:04,853 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 12 [2018-12-03 19:37:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:04,854 INFO L225 Difference]: With dead ends: 15 [2018-12-03 19:37:04,854 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 19:37:04,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 19:37:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 19:37:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 19:37:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 19:37:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 19:37:04,860 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 19:37:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:04,860 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 19:37:04,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 19:37:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 19:37:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 19:37:04,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:04,861 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-12-03 19:37:04,861 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:04,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:04,861 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-12-03 19:37:04,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:04,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:04,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:04,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:04,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:05,122 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 19:37:05,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:05,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:05,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:05,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:05,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:05,123 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 19:37:05,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:05,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:05,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 19:37:05,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:05,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:05,763 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 19:37:05,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:06,115 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 19:37:06,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:06,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2018-12-03 19:37:06,137 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:06,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 19:37:06,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 19:37:06,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1040, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 19:37:06,139 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 25 states. [2018-12-03 19:37:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:06,383 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 19:37:06,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 19:37:06,383 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 13 [2018-12-03 19:37:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:06,384 INFO L225 Difference]: With dead ends: 16 [2018-12-03 19:37:06,384 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 19:37:06,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=292, Invalid=1040, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 19:37:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 19:37:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 19:37:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 19:37:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 19:37:06,389 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 19:37:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:06,389 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 19:37:06,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 19:37:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 19:37:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 19:37:06,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:06,390 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-12-03 19:37:06,390 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:06,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-12-03 19:37:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:06,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:06,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:06,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:06,981 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 19:37:06,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:06,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:06,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:06,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:06,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:06,982 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 19:37:06,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:06,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:07,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:07,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:07,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:07,653 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 19:37:07,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:08,123 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 19:37:08,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:08,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2018-12-03 19:37:08,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:08,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 19:37:08,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 19:37:08,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 19:37:08,144 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 27 states. [2018-12-03 19:37:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:08,515 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 19:37:08,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 19:37:08,516 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 14 [2018-12-03 19:37:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:08,516 INFO L225 Difference]: With dead ends: 17 [2018-12-03 19:37:08,516 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 19:37:08,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 19:37:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 19:37:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 19:37:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 19:37:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 19:37:08,520 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 19:37:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:08,521 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 19:37:08,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 19:37:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 19:37:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:37:08,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:08,522 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-12-03 19:37:08,522 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:08,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-12-03 19:37:08,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:08,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:08,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:08,959 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 19:37:08,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:08,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:08,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:08,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:08,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:08,960 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 19:37:08,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:08,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:08,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:09,548 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 19:37:09,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:10,027 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 19:37:10,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:10,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2018-12-03 19:37:10,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:10,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 19:37:10,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 19:37:10,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 19:37:10,048 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 29 states. [2018-12-03 19:37:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:10,374 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 19:37:10,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 19:37:10,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 15 [2018-12-03 19:37:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:10,376 INFO L225 Difference]: With dead ends: 18 [2018-12-03 19:37:10,376 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 19:37:10,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 19:37:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 19:37:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 19:37:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 19:37:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 19:37:10,381 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 19:37:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:10,382 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 19:37:10,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 19:37:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 19:37:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:37:10,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:10,383 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-12-03 19:37:10,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:10,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-12-03 19:37:10,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:10,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:10,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:10,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:10,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:10,696 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 19:37:10,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:10,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:10,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:10,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:10,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:10,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:37:10,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:10,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:10,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 19:37:10,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:10,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:11,446 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 19:37:11,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:12,246 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 19:37:12,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:12,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2018-12-03 19:37:12,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:12,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 19:37:12,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 19:37:12,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1637, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 19:37:12,268 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 31 states. [2018-12-03 19:37:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:12,649 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 19:37:12,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 19:37:12,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 16 [2018-12-03 19:37:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:12,651 INFO L225 Difference]: With dead ends: 19 [2018-12-03 19:37:12,651 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 19:37:12,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=433, Invalid=1637, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 19:37:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 19:37:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 19:37:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 19:37:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 19:37:12,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 19:37:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:12,656 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 19:37:12,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 19:37:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 19:37:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 19:37:12,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:12,657 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-12-03 19:37:12,657 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:12,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-12-03 19:37:12,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:12,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:12,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:13,173 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 19:37:13,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:13,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:13,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:13,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:13,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:13,174 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 19:37:13,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:13,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:13,193 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:13,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:13,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:14,024 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 19:37:14,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:14,766 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 19:37:14,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:14,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2018-12-03 19:37:14,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:14,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 19:37:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 19:37:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=1866, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 19:37:14,787 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 33 states. [2018-12-03 19:37:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:15,199 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 19:37:15,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 19:37:15,199 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 17 [2018-12-03 19:37:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:15,200 INFO L225 Difference]: With dead ends: 20 [2018-12-03 19:37:15,200 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 19:37:15,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=486, Invalid=1866, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 19:37:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 19:37:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 19:37:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 19:37:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 19:37:15,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 19:37:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:15,206 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 19:37:15,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 19:37:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 19:37:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:37:15,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:15,207 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-12-03 19:37:15,207 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:15,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-12-03 19:37:15,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:15,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:15,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:15,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:15,635 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 19:37:15,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:15,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:15,636 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:15,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:15,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:15,637 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 19:37:15,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:15,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:15,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:16,528 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 19:37:16,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:17,423 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 19:37:17,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:17,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2018-12-03 19:37:17,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:17,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 19:37:17,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 19:37:17,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 19:37:17,444 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 35 states. [2018-12-03 19:37:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:17,952 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 19:37:17,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 19:37:17,953 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 18 [2018-12-03 19:37:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:17,953 INFO L225 Difference]: With dead ends: 21 [2018-12-03 19:37:17,954 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 19:37:17,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 19:37:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 19:37:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 19:37:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 19:37:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 19:37:17,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 19:37:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:17,960 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 19:37:17,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 19:37:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 19:37:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:37:17,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:17,961 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-12-03 19:37:17,961 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:17,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-12-03 19:37:17,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:17,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:17,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:18,378 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 19:37:18,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:18,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:18,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:18,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:18,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:18,379 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 19:37:18,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:18,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:18,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 19:37:18,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:18,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:19,489 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 19:37:19,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:20,346 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 19:37:20,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:20,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2018-12-03 19:37:20,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:20,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 19:37:20,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 19:37:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=2369, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 19:37:20,368 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 37 states. [2018-12-03 19:37:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:20,888 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 19:37:20,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 19:37:20,888 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 19 [2018-12-03 19:37:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:20,889 INFO L225 Difference]: With dead ends: 22 [2018-12-03 19:37:20,889 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 19:37:20,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=601, Invalid=2369, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 19:37:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 19:37:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 19:37:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 19:37:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 19:37:20,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 19:37:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:20,896 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 19:37:20,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 19:37:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 19:37:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 19:37:20,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:20,896 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-12-03 19:37:20,896 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:20,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-12-03 19:37:20,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:20,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:20,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:21,439 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 19:37:21,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:21,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:21,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:21,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:21,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:21,440 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 19:37:21,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:21,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:21,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:21,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:21,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:22,626 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 19:37:22,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:23,529 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 19:37:23,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:23,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2018-12-03 19:37:23,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:23,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 19:37:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 19:37:23,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=2643, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 19:37:23,551 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 39 states. [2018-12-03 19:37:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:24,356 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 19:37:24,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 19:37:24,356 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 20 [2018-12-03 19:37:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:24,357 INFO L225 Difference]: With dead ends: 23 [2018-12-03 19:37:24,357 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 19:37:24,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=663, Invalid=2643, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 19:37:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 19:37:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 19:37:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 19:37:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 19:37:24,363 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 19:37:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:24,364 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 19:37:24,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 19:37:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 19:37:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 19:37:24,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:24,365 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-12-03 19:37:24,365 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:24,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-12-03 19:37:24,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:24,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:24,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:24,899 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 19:37:24,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:24,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:24,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:24,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:24,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:24,900 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 19:37:24,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:24,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:24,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:26,918 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 19:37:26,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:28,033 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 19:37:28,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:28,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2018-12-03 19:37:28,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:28,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 19:37:28,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 19:37:28,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2932, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 19:37:28,054 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 41 states. [2018-12-03 19:37:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:28,978 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 19:37:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 19:37:28,979 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2018-12-03 19:37:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:28,979 INFO L225 Difference]: With dead ends: 24 [2018-12-03 19:37:28,980 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 19:37:28,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=728, Invalid=2932, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 19:37:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 19:37:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 19:37:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 19:37:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 19:37:28,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 19:37:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:28,986 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 19:37:28,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 19:37:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 19:37:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 19:37:28,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:28,987 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-12-03 19:37:28,987 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:28,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-12-03 19:37:28,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:28,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:28,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:29,633 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 19:37:29,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:29,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:29,634 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:29,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:29,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:29,634 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 19:37:29,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:29,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:29,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 19:37:29,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:29,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:31,590 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 19:37:31,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:32,787 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 19:37:32,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:32,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2018-12-03 19:37:32,807 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:32,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 19:37:32,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 19:37:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=3236, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 19:37:32,809 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 43 states. [2018-12-03 19:37:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:33,856 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 19:37:33,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 19:37:33,856 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 22 [2018-12-03 19:37:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:33,857 INFO L225 Difference]: With dead ends: 25 [2018-12-03 19:37:33,857 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 19:37:33,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=796, Invalid=3236, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 19:37:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 19:37:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 19:37:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 19:37:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 19:37:33,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 19:37:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:33,863 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 19:37:33,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 19:37:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 19:37:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 19:37:33,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:33,864 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-12-03 19:37:33,864 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:33,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-12-03 19:37:33,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:33,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:33,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:33,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:33,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:34,800 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 19:37:34,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:34,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:34,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:34,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:34,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:34,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:37:34,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:34,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:34,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:34,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:34,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:36,157 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 19:37:36,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:37,457 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 19:37:37,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:37,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2018-12-03 19:37:37,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:37,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 19:37:37,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 19:37:37,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=3555, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 19:37:37,479 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 45 states. [2018-12-03 19:37:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:38,353 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 19:37:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 19:37:38,356 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 23 [2018-12-03 19:37:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:38,356 INFO L225 Difference]: With dead ends: 26 [2018-12-03 19:37:38,357 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 19:37:38,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=867, Invalid=3555, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 19:37:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 19:37:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 19:37:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 19:37:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 19:37:38,361 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 19:37:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:38,361 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 19:37:38,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 19:37:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 19:37:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 19:37:38,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:38,362 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-12-03 19:37:38,363 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:38,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:38,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-12-03 19:37:38,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:38,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:38,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:38,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:38,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:39,093 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 19:37:39,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:39,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:39,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:39,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:39,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:39,094 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 19:37:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:39,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:39,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:40,962 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 19:37:40,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:42,894 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 19:37:42,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:42,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2018-12-03 19:37:42,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:42,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 19:37:42,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 19:37:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=941, Invalid=3889, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 19:37:42,915 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 47 states. [2018-12-03 19:37:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:43,885 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 19:37:43,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 19:37:43,885 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 24 [2018-12-03 19:37:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:43,886 INFO L225 Difference]: With dead ends: 27 [2018-12-03 19:37:43,886 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 19:37:43,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=941, Invalid=3889, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 19:37:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 19:37:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 19:37:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 19:37:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 19:37:43,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 19:37:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:43,892 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 19:37:43,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 19:37:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 19:37:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 19:37:43,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:43,893 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-12-03 19:37:43,893 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:43,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-12-03 19:37:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:43,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:43,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:45,267 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 19:37:45,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:45,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:45,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:45,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:45,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:45,268 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 19:37:45,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:45,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:45,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 19:37:45,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:45,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:46,980 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 19:37:46,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:48,648 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 19:37:48,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:48,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2018-12-03 19:37:48,669 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:48,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 19:37:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 19:37:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=4238, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 19:37:48,671 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 49 states. [2018-12-03 19:37:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:49,641 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 19:37:49,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 19:37:49,641 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 25 [2018-12-03 19:37:49,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:49,642 INFO L225 Difference]: With dead ends: 28 [2018-12-03 19:37:49,642 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 19:37:49,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1018, Invalid=4238, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 19:37:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 19:37:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 19:37:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 19:37:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 19:37:49,647 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 19:37:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:49,647 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 19:37:49,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 19:37:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 19:37:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 19:37:49,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:49,650 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-12-03 19:37:49,650 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:49,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-12-03 19:37:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:49,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:49,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:50,511 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 19:37:50,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:50,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:50,511 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:50,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:50,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:50,512 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 19:37:50,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:50,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:50,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:50,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:50,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:52,442 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 19:37:52,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:54,317 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 19:37:54,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:54,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2018-12-03 19:37:54,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:54,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 19:37:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 19:37:54,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1098, Invalid=4602, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 19:37:54,339 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 51 states. [2018-12-03 19:37:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:55,466 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 19:37:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 19:37:55,467 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 26 [2018-12-03 19:37:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:55,468 INFO L225 Difference]: With dead ends: 29 [2018-12-03 19:37:55,468 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 19:37:55,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1098, Invalid=4602, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 19:37:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 19:37:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 19:37:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 19:37:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 19:37:55,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 19:37:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:55,474 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 19:37:55,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 19:37:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 19:37:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 19:37:55,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:55,475 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-12-03 19:37:55,475 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:55,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-12-03 19:37:55,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:55,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:55,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:56,471 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 19:37:56,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:56,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:56,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:56,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:56,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:56,472 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 19:37:56,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:56,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:56,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:58,515 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 19:37:58,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:00,706 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 19:38:00,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:00,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2018-12-03 19:38:00,725 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:00,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 19:38:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 19:38:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=4981, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 19:38:00,727 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 53 states. [2018-12-03 19:38:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:01,906 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 19:38:01,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 19:38:01,907 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 27 [2018-12-03 19:38:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:01,908 INFO L225 Difference]: With dead ends: 30 [2018-12-03 19:38:01,908 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 19:38:01,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1181, Invalid=4981, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 19:38:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 19:38:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 19:38:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 19:38:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 19:38:01,915 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 19:38:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:01,915 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 19:38:01,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 19:38:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 19:38:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 19:38:01,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:01,916 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-12-03 19:38:01,916 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:01,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-12-03 19:38:01,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:01,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:01,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:01,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:03,531 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 19:38:03,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:03,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:03,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:03,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:03,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:03,532 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 19:38:03,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:03,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:03,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 19:38:03,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:03,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:05,975 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 19:38:05,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:08,285 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 19:38:08,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:08,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2018-12-03 19:38:08,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:08,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 19:38:08,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 19:38:08,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=5375, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 19:38:08,305 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 55 states. [2018-12-03 19:38:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:09,920 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 19:38:09,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 19:38:09,921 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 28 [2018-12-03 19:38:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:09,921 INFO L225 Difference]: With dead ends: 31 [2018-12-03 19:38:09,921 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 19:38:09,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1755 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1267, Invalid=5375, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 19:38:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 19:38:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 19:38:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 19:38:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 19:38:09,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 19:38:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:09,927 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 19:38:09,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 19:38:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 19:38:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 19:38:09,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:09,928 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-12-03 19:38:09,928 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:09,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-12-03 19:38:09,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:09,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:09,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:11,164 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 19:38:11,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:11,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:11,164 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:11,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 19:38:11,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:11,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 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 19:38:11,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:38:11,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:38:11,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:38:11,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:11,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:13,728 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 19:38:13,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:16,461 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 19:38:16,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:16,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2018-12-03 19:38:16,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:16,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 19:38:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 19:38:16,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1356, Invalid=5784, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 19:38:16,483 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 57 states. [2018-12-03 19:38:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:18,060 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 19:38:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 19:38:18,060 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 29 [2018-12-03 19:38:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:18,061 INFO L225 Difference]: With dead ends: 32 [2018-12-03 19:38:18,061 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 19:38:18,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1356, Invalid=5784, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 19:38:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 19:38:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 19:38:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 19:38:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 19:38:18,067 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 19:38:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:18,067 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 19:38:18,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 19:38:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 19:38:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:38:18,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:18,068 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-12-03 19:38:18,068 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:18,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:18,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-12-03 19:38:18,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:18,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:18,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:19,458 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 19:38:19,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:19,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:19,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:19,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:19,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:19,459 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 19:38:19,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:19,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:19,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:22,443 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 19:38:22,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:25,238 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 19:38:25,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2018-12-03 19:38:25,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:25,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 19:38:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 19:38:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1448, Invalid=6208, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 19:38:25,260 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 59 states. [2018-12-03 19:38:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:27,089 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 19:38:27,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 19:38:27,090 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 30 [2018-12-03 19:38:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:27,090 INFO L225 Difference]: With dead ends: 33 [2018-12-03 19:38:27,090 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 19:38:27,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1448, Invalid=6208, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 19:38:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 19:38:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 19:38:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 19:38:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 19:38:27,103 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 19:38:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:27,103 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 19:38:27,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 19:38:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 19:38:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 19:38:27,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:27,104 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-12-03 19:38:27,104 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:27,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-12-03 19:38:27,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:27,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:27,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:28,654 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 19:38:28,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:28,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:28,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:28,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:28,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:28,655 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 19:38:28,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:28,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:28,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 19:38:28,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:28,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:31,910 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 19:38:31,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:35,000 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 19:38:35,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:35,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2018-12-03 19:38:35,020 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:35,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 19:38:35,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 19:38:35,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=6647, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 19:38:35,023 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 61 states. [2018-12-03 19:38:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:36,967 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 19:38:36,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 19:38:36,968 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 31 [2018-12-03 19:38:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:36,969 INFO L225 Difference]: With dead ends: 34 [2018-12-03 19:38:36,969 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 19:38:36,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1543, Invalid=6647, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 19:38:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 19:38:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 19:38:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 19:38:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 19:38:36,974 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 19:38:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:36,974 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 19:38:36,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 19:38:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 19:38:36,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 19:38:36,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:36,975 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-12-03 19:38:36,975 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:36,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-12-03 19:38:36,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:36,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:36,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:36,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:36,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:38,530 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 19:38:38,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:38,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:38,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:38,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:38,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:38,531 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 19:38:38,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:38:38,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:38:38,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:38:38,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:38,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:41,987 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 19:38:41,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:45,391 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 19:38:45,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:45,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2018-12-03 19:38:45,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:45,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 19:38:45,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 19:38:45,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1641, Invalid=7101, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 19:38:45,413 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 63 states. [2018-12-03 19:38:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:47,664 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 19:38:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 19:38:47,664 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 32 [2018-12-03 19:38:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:47,665 INFO L225 Difference]: With dead ends: 35 [2018-12-03 19:38:47,665 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 19:38:47,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2325 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1641, Invalid=7101, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 19:38:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 19:38:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 19:38:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 19:38:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 19:38:47,670 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 19:38:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:47,670 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 19:38:47,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 19:38:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 19:38:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 19:38:47,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:47,671 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-12-03 19:38:47,671 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:47,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-12-03 19:38:47,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:47,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:47,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:49,326 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 19:38:49,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:49,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:49,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:49,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:49,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:49,327 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 19:38:49,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:49,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:49,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:52,968 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 19:38:52,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:56,791 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 19:38:56,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:56,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2018-12-03 19:38:56,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:56,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 19:38:56,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 19:38:56,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1742, Invalid=7570, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 19:38:56,811 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 65 states. [2018-12-03 19:38:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:58,694 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 19:38:58,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 19:38:58,694 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 33 [2018-12-03 19:38:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:58,695 INFO L225 Difference]: With dead ends: 36 [2018-12-03 19:38:58,695 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 19:38:58,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1742, Invalid=7570, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 19:38:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 19:38:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 19:38:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 19:38:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 19:38:58,700 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 19:38:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:58,701 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 19:38:58,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 19:38:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 19:38:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:38:58,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:58,701 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-12-03 19:38:58,702 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:58,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-12-03 19:38:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:58,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:58,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:58,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:00,657 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 19:39:00,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:00,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:00,658 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:00,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:00,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:00,658 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 19:39:00,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:39:00,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:39:00,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 19:39:00,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:00,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:04,648 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 19:39:04,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:08,996 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 19:39:09,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:09,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2018-12-03 19:39:09,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:09,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 19:39:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 19:39:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1846, Invalid=8054, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 19:39:09,016 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 67 states. [2018-12-03 19:39:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:11,292 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 19:39:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 19:39:11,293 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 34 [2018-12-03 19:39:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:11,293 INFO L225 Difference]: With dead ends: 37 [2018-12-03 19:39:11,293 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 19:39:11,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1846, Invalid=8054, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 19:39:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 19:39:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 19:39:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 19:39:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 19:39:11,300 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 19:39:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:11,300 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 19:39:11,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 19:39:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 19:39:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 19:39:11,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:11,301 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-12-03 19:39:11,301 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:11,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:11,301 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-12-03 19:39:11,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:11,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:11,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:11,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:11,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:13,288 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 19:39:13,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:13,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:13,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:13,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:13,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:13,289 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 19:39:13,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:39:13,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:39:13,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:39:13,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:13,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:17,621 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 19:39:17,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:22,017 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 19:39:22,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:22,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2018-12-03 19:39:22,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:22,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 19:39:22,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 19:39:22,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=8553, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 19:39:22,037 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 69 states. [2018-12-03 19:39:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:24,966 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 19:39:24,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 19:39:24,967 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 35 [2018-12-03 19:39:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:24,967 INFO L225 Difference]: With dead ends: 38 [2018-12-03 19:39:24,968 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 19:39:24,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2805 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1953, Invalid=8553, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 19:39:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 19:39:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 19:39:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 19:39:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 19:39:24,973 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 19:39:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:24,973 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 19:39:24,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 19:39:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 19:39:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:39:24,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:24,974 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-12-03 19:39:24,974 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:24,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-12-03 19:39:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:24,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:24,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:27,115 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 19:39:27,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:27,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:27,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:27,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:27,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:27,116 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 19:39:27,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:27,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:39:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:27,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:31,829 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 19:39:31,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:36,553 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 19:39:36,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:36,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2018-12-03 19:39:36,572 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:36,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 19:39:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 19:39:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2063, Invalid=9067, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 19:39:36,574 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 71 states. [2018-12-03 19:39:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:39,283 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 19:39:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 19:39:39,284 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 36 [2018-12-03 19:39:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:39,285 INFO L225 Difference]: With dead ends: 39 [2018-12-03 19:39:39,285 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 19:39:39,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2975 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2063, Invalid=9067, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 19:39:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 19:39:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 19:39:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 19:39:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 19:39:39,291 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 19:39:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:39,291 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 19:39:39,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 19:39:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 19:39:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 19:39:39,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:39,292 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-12-03 19:39:39,292 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:39,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-12-03 19:39:39,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:39,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:39,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:41,567 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 19:39:41,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:41,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:41,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:41,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:41,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:41,568 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 19:39:41,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:39:41,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:39:41,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 19:39:41,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:41,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:46,667 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 19:39:46,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:51,678 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 19:39:51,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:51,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2018-12-03 19:39:51,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:51,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 19:39:51,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 19:39:51,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2176, Invalid=9596, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 19:39:51,699 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 73 states. [2018-12-03 19:39:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:54,657 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 19:39:54,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 19:39:54,658 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 37 [2018-12-03 19:39:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:54,659 INFO L225 Difference]: With dead ends: 40 [2018-12-03 19:39:54,659 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 19:39:54,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=2176, Invalid=9596, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 19:39:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 19:39:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 19:39:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 19:39:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 19:39:54,663 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 19:39:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:54,663 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 19:39:54,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 19:39:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 19:39:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 19:39:54,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:54,664 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-12-03 19:39:54,664 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:54,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-12-03 19:39:54,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:54,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:54,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:54,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:57,123 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 19:39:57,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:57,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:57,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:57,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:57,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:57,124 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 19:39:57,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:39:57,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:39:57,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:39:57,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:57,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:02,498 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 19:40:02,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:08,149 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 19:40:08,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:08,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2018-12-03 19:40:08,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:08,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 19:40:08,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 19:40:08,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2292, Invalid=10140, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 19:40:08,170 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 75 states. [2018-12-03 19:40:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:11,698 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 19:40:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 19:40:11,698 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 38 [2018-12-03 19:40:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:11,699 INFO L225 Difference]: With dead ends: 41 [2018-12-03 19:40:11,699 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 19:40:11,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=2292, Invalid=10140, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 19:40:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 19:40:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 19:40:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 19:40:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 19:40:11,704 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 19:40:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:11,705 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 19:40:11,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 19:40:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 19:40:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 19:40:11,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:11,705 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-12-03 19:40:11,706 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:11,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-12-03 19:40:11,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:11,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:11,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:14,311 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 19:40:14,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:14,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:14,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:14,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:14,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:14,312 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 19:40:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:14,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:40:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:14,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:19,963 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 19:40:19,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:25,749 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 19:40:25,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:25,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2018-12-03 19:40:25,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:25,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 19:40:25,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 19:40:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2411, Invalid=10699, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 19:40:25,769 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 77 states. [2018-12-03 19:40:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:29,333 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 19:40:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 19:40:29,333 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 39 [2018-12-03 19:40:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:29,334 INFO L225 Difference]: With dead ends: 42 [2018-12-03 19:40:29,334 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 19:40:29,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3515 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=2411, Invalid=10699, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 19:40:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 19:40:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 19:40:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 19:40:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 19:40:29,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 19:40:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:29,339 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 19:40:29,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 19:40:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 19:40:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 19:40:29,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:29,340 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-12-03 19:40:29,340 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:29,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-12-03 19:40:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:29,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:29,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:32,066 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 19:40:32,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:32,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:32,067 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:32,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 19:40:32,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:32,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 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 19:40:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:40:32,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:40:32,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 19:40:32,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:32,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:38,109 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 19:40:38,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:44,442 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 19:40:44,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:44,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2018-12-03 19:40:44,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:44,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 19:40:44,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 19:40:44,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2533, Invalid=11273, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 19:40:44,462 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 79 states. [2018-12-03 19:40:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:48,224 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 19:40:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 19:40:48,224 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 40 [2018-12-03 19:40:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:48,225 INFO L225 Difference]: With dead ends: 43 [2018-12-03 19:40:48,225 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 19:40:48,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3705 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=2533, Invalid=11273, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 19:40:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 19:40:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 19:40:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 19:40:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 19:40:48,231 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 19:40:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:48,231 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 19:40:48,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 19:40:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 19:40:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 19:40:48,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:48,232 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-12-03 19:40:48,232 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:48,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-12-03 19:40:48,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:48,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:48,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:51,177 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 19:40:51,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:51,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:51,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:51,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:51,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:51,178 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 19:40:51,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:40:51,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:40:51,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:40:51,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:51,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:57,673 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 19:40:57,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:04,442 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 19:41:04,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:04,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2018-12-03 19:41:04,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:04,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 19:41:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 19:41:04,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2658, Invalid=11862, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 19:41:04,462 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 81 states. [2018-12-03 19:41:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:08,608 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 19:41:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 19:41:08,609 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 41 [2018-12-03 19:41:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:08,609 INFO L225 Difference]: With dead ends: 44 [2018-12-03 19:41:08,610 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 19:41:08,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3900 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=2658, Invalid=11862, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 19:41:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 19:41:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 19:41:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 19:41:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 19:41:08,616 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 19:41:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:08,616 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 19:41:08,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 19:41:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 19:41:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 19:41:08,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:08,617 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-12-03 19:41:08,617 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:08,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-12-03 19:41:08,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:08,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:08,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:08,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:08,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:11,788 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 19:41:11,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:11,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:11,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:11,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:11,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:11,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:41:11,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:11,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:41:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:11,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:18,770 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 19:41:18,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:25,980 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 19:41:25,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:25,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2018-12-03 19:41:25,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:26,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 19:41:26,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 19:41:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=12466, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 19:41:26,000 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 83 states. [2018-12-03 19:41:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:30,568 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 19:41:30,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 19:41:30,568 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 42 [2018-12-03 19:41:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:30,569 INFO L225 Difference]: With dead ends: 45 [2018-12-03 19:41:30,569 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 19:41:30,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4100 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=2786, Invalid=12466, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 19:41:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 19:41:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 19:41:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 19:41:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 19:41:30,573 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 19:41:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:30,574 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 19:41:30,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 19:41:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 19:41:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 19:41:30,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:30,574 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-12-03 19:41:30,574 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:30,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-12-03 19:41:30,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:30,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:30,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:30,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:30,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:34,001 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 19:41:34,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:34,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:34,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:34,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 19:41:34,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:34,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 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 19:41:34,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:41:34,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:41:34,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 19:41:34,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:34,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:41,569 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 19:41:41,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:49,202 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 19:41:49,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:49,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2018-12-03 19:41:49,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:49,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 19:41:49,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 19:41:49,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2917, Invalid=13085, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 19:41:49,222 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 85 states. [2018-12-03 19:41:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:54,194 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 19:41:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 19:41:54,194 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 43 [2018-12-03 19:41:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:54,195 INFO L225 Difference]: With dead ends: 46 [2018-12-03 19:41:54,195 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 19:41:54,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4387 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=2917, Invalid=13085, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 19:41:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 19:41:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 19:41:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 19:41:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 19:41:54,200 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 19:41:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:54,200 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 19:41:54,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 19:41:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 19:41:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 19:41:54,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:54,201 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-12-03 19:41:54,201 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:54,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-12-03 19:41:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:54,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:54,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:58,525 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 19:41:58,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:58,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:58,526 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:58,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:58,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:58,526 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 19:41:58,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:41:58,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:41:58,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:41:58,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:58,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:06,585 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 19:42:06,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:14,813 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 19:42:14,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:14,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2018-12-03 19:42:14,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:14,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 19:42:14,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 19:42:14,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3051, Invalid=13719, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 19:42:14,836 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 87 states. [2018-12-03 19:42:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:19,550 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 19:42:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 19:42:19,551 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 44 [2018-12-03 19:42:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:19,552 INFO L225 Difference]: With dead ends: 47 [2018-12-03 19:42:19,552 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 19:42:19,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4515 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=3051, Invalid=13719, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 19:42:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 19:42:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 19:42:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 19:42:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 19:42:19,557 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 19:42:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:19,557 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 19:42:19,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 19:42:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 19:42:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 19:42:19,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:19,558 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-12-03 19:42:19,558 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:19,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:19,558 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-12-03 19:42:19,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:19,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:19,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:42:19,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:19,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:23,378 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 19:42:23,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:23,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:23,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:23,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:23,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:23,379 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 19:42:23,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:23,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:42:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:23,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:31,771 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 19:42:31,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:40,577 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 19:42:40,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:40,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2018-12-03 19:42:40,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:40,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 19:42:40,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 19:42:40,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3188, Invalid=14368, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 19:42:40,599 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 89 states. [2018-12-03 19:42:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:46,234 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 19:42:46,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 19:42:46,235 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 45 [2018-12-03 19:42:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:46,236 INFO L225 Difference]: With dead ends: 48 [2018-12-03 19:42:46,236 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 19:42:46,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4730 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=3188, Invalid=14368, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 19:42:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 19:42:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 19:42:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 19:42:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 19:42:46,241 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 19:42:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:46,241 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 19:42:46,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 19:42:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 19:42:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 19:42:46,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:46,242 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-12-03 19:42:46,242 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:46,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-12-03 19:42:46,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:46,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:46,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:46,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:46,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:50,345 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 19:42:50,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:50,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:50,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:50,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:50,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:50,345 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 19:42:50,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:42:50,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:42:50,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 19:42:50,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:42:50,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:59,475 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 19:42:59,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:08,907 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 19:43:08,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:08,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2018-12-03 19:43:08,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:08,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 19:43:08,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 19:43:08,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3328, Invalid=15032, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 19:43:08,927 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 91 states. [2018-12-03 19:43:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:14,594 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 19:43:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 19:43:14,594 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 46 [2018-12-03 19:43:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:14,595 INFO L225 Difference]: With dead ends: 49 [2018-12-03 19:43:14,595 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 19:43:14,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=3328, Invalid=15032, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 19:43:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 19:43:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 19:43:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 19:43:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 19:43:14,600 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 19:43:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:14,601 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 19:43:14,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 19:43:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 19:43:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 19:43:14,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:14,601 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-12-03 19:43:14,601 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:14,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-12-03 19:43:14,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:14,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:43:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:14,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:19,347 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 19:43:19,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:19,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:19,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:19,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:19,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:19,348 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 19:43:19,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:43:19,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:43:19,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:43:19,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:43:19,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:43:28,886 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 19:43:28,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:38,849 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 19:43:38,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:38,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2018-12-03 19:43:38,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:38,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 19:43:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 19:43:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3471, Invalid=15711, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 19:43:38,869 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 93 states. [2018-12-03 19:43:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:45,011 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 19:43:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 19:43:45,011 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 47 [2018-12-03 19:43:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:45,012 INFO L225 Difference]: With dead ends: 50 [2018-12-03 19:43:45,012 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 19:43:45,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5175 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=3471, Invalid=15711, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 19:43:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 19:43:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 19:43:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 19:43:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 19:43:45,018 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 19:43:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:45,019 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 19:43:45,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 19:43:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 19:43:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 19:43:45,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:45,019 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-12-03 19:43:45,020 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:45,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-12-03 19:43:45,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:45,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:45,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:43:45,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:45,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:50,002 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 19:43:50,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:50,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:50,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:50,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 19:43:50,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:50,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 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 19:43:50,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:43:50,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:43:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:50,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:00,309 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 19:44:00,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:11,003 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 19:44:11,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:11,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2018-12-03 19:44:11,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:11,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 19:44:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 19:44:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3617, Invalid=16405, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 19:44:11,023 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 95 states. [2018-12-03 19:44:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:17,665 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 19:44:17,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 19:44:17,666 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 48 [2018-12-03 19:44:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:17,666 INFO L225 Difference]: With dead ends: 51 [2018-12-03 19:44:17,667 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 19:44:17,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5405 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=3617, Invalid=16405, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 19:44:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 19:44:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 19:44:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 19:44:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 19:44:17,673 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 19:44:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:17,673 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 19:44:17,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 19:44:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 19:44:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 19:44:17,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:17,674 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-12-03 19:44:17,674 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:17,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-12-03 19:44:17,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:17,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:17,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:17,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:17,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:22,889 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 19:44:22,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:22,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:22,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:22,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:22,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:22,890 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 19:44:22,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:44:22,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:44:22,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 19:44:22,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:23,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:34,080 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 19:44:34,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:45,938 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 19:44:45,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:45,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2018-12-03 19:44:45,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:45,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 19:44:45,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 19:44:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3766, Invalid=17114, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 19:44:45,959 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 97 states. [2018-12-03 19:44:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:52,754 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 19:44:52,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 19:44:52,755 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 49 [2018-12-03 19:44:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:52,756 INFO L225 Difference]: With dead ends: 52 [2018-12-03 19:44:52,756 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 19:44:52,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=3766, Invalid=17114, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 19:44:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 19:44:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 19:44:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 19:44:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 19:44:52,762 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 19:44:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:52,763 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 19:44:52,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 19:44:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 19:44:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 19:44:52,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:52,763 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-12-03 19:44:52,764 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:52,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:52,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-12-03 19:44:52,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:52,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:52,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:44:52,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:52,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:58,087 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 19:44:58,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:58,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:58,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:58,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:58,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:58,088 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 19:44:58,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:44:58,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:44:58,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:44:58,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:58,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:09,534 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 19:45:09,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:21,565 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 19:45:21,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:21,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2018-12-03 19:45:21,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:21,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 19:45:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 19:45:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=17838, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 19:45:21,594 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 99 states. [2018-12-03 19:45:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:28,959 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 19:45:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 19:45:28,960 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 50 [2018-12-03 19:45:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:28,961 INFO L225 Difference]: With dead ends: 53 [2018-12-03 19:45:28,961 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 19:45:28,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=3918, Invalid=17838, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 19:45:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 19:45:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 19:45:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 19:45:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 19:45:28,969 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 19:45:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:28,969 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 19:45:28,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 19:45:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 19:45:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 19:45:28,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:28,970 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-12-03 19:45:28,970 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:28,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:28,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-12-03 19:45:28,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:28,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:28,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:45:28,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:28,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:34,561 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 19:45:34,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:34,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:45:34,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:45:34,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:45:34,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:34,562 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 19:45:34,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:45:34,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:45:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:34,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:46,780 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 19:45:46,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:59,584 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 19:45:59,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:59,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2018-12-03 19:45:59,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:59,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 19:45:59,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 19:45:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4073, Invalid=18577, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 19:45:59,605 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 101 states. [2018-12-03 19:46:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:06,337 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 19:46:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 19:46:06,338 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 51 [2018-12-03 19:46:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:06,338 INFO L225 Difference]: With dead ends: 54 [2018-12-03 19:46:06,338 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 19:46:06,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6125 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=4073, Invalid=18577, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 19:46:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 19:46:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 19:46:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 19:46:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 19:46:06,344 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 19:46:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:06,344 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 19:46:06,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 19:46:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 19:46:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 19:46:06,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:06,345 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-12-03 19:46:06,345 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:06,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-12-03 19:46:06,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:06,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:46:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:06,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:12,305 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 19:46:12,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:12,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:12,306 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:12,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:12,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:12,306 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 19:46:12,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:46:12,317 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:46:12,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 19:46:12,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:46:12,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:25,451 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 19:46:25,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:38,980 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 19:46:39,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:39,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2018-12-03 19:46:39,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:39,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 19:46:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 19:46:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4231, Invalid=19331, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 19:46:39,014 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 103 states. [2018-12-03 19:46:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:47,613 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 19:46:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 19:46:47,614 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 52 [2018-12-03 19:46:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:47,615 INFO L225 Difference]: With dead ends: 55 [2018-12-03 19:46:47,615 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 19:46:47,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6375 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=4231, Invalid=19331, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 19:46:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 19:46:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 19:46:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 19:46:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 19:46:47,621 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 19:46:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:47,621 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 19:46:47,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 19:46:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 19:46:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 19:46:47,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:47,622 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-12-03 19:46:47,622 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:47,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-12-03 19:46:47,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:47,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:47,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:46:47,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:47,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:53,982 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 19:46:53,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:53,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:53,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:53,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:53,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:53,983 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 19:46:53,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:46:53,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:46:54,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:46:54,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:46:54,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:47:07,855 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 19:47:07,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:47:22,395 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 19:47:22,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:47:22,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2018-12-03 19:47:22,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:47:22,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 19:47:22,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 19:47:22,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4392, Invalid=20100, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 19:47:22,418 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 105 states. [2018-12-03 19:47:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:47:30,426 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 19:47:30,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 19:47:30,427 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 53 [2018-12-03 19:47:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:47:30,427 INFO L225 Difference]: With dead ends: 56 [2018-12-03 19:47:30,427 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 19:47:30,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6630 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=4392, Invalid=20100, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 19:47:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 19:47:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 19:47:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 19:47:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 19:47:30,434 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 19:47:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:47:30,435 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 19:47:30,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 19:47:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 19:47:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 19:47:30,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:47:30,435 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-12-03 19:47:30,436 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:47:30,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:47:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-12-03 19:47:30,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:47:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:30,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:47:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:30,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:47:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:47:37,679 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 19:47:37,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:47:37,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:47:37,680 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:47:37,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:47:37,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:47:37,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 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 19:47:37,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:47:37,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:47:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:47:37,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:47:52,357 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 19:47:52,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:48:07,601 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 19:48:07,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:48:07,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2018-12-03 19:48:07,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:48:07,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 19:48:07,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 19:48:07,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4556, Invalid=20884, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 19:48:07,621 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 107 states. [2018-12-03 19:48:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:48:15,434 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 19:48:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 19:48:15,434 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 54 [2018-12-03 19:48:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:48:15,435 INFO L225 Difference]: With dead ends: 57 [2018-12-03 19:48:15,435 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 19:48:15,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6890 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=4556, Invalid=20884, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 19:48:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 19:48:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 19:48:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 19:48:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 19:48:15,440 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 19:48:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:48:15,441 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 19:48:15,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 19:48:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 19:48:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 19:48:15,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:48:15,441 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-12-03 19:48:15,442 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:48:15,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:48:15,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-12-03 19:48:15,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:48:15,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:48:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:15,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:48:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:48:22,419 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 19:48:22,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:22,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:48:22,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:48:22,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:48:22,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:22,420 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 19:48:22,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:48:22,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:48:22,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 19:48:22,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:48:22,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:48:37,730 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 19:48:37,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:48:54,027 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 19:48:54,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:48:54,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2018-12-03 19:48:54,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:48:54,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 19:48:54,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 19:48:54,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4723, Invalid=21683, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 19:48:54,047 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 109 states. [2018-12-03 19:49:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:49:04,413 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 19:49:04,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 19:49:04,413 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 55 [2018-12-03 19:49:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:49:04,414 INFO L225 Difference]: With dead ends: 58 [2018-12-03 19:49:04,414 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 19:49:04,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7155 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=4723, Invalid=21683, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 19:49:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 19:49:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 19:49:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 19:49:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 19:49:04,421 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 19:49:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:49:04,422 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 19:49:04,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 19:49:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 19:49:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 19:49:04,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:49:04,422 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-12-03 19:49:04,423 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:49:04,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:49:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-12-03 19:49:04,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:49:04,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:49:04,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:49:04,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:49:04,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:49:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:49:11,843 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 19:49:11,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:49:11,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:49:11,843 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:49:11,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:49:11,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:49:11,843 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 19:49:11,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:49:11,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:49:11,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:49:11,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:49:11,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:49:28,053 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 19:49:28,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:49:45,172 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 19:49:45,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:49:45,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2018-12-03 19:49:45,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:49:45,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 19:49:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 19:49:45,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4893, Invalid=22497, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 19:49:45,192 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 111 states. [2018-12-03 19:49:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:49:55,321 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 19:49:55,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 19:49:55,322 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 56 [2018-12-03 19:49:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:49:55,322 INFO L225 Difference]: With dead ends: 59 [2018-12-03 19:49:55,323 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 19:49:55,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7425 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=4893, Invalid=22497, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 19:49:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 19:49:55,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 19:49:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 19:49:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 19:49:55,329 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 19:49:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:49:55,329 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 19:49:55,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 19:49:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 19:49:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 19:49:55,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:49:55,330 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-12-03 19:49:55,330 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:49:55,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:49:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-12-03 19:49:55,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:49:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:49:55,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:49:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:49:55,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:49:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:50:03,319 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 19:50:03,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:50:03,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:50:03,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:50:03,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:50:03,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:50:03,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 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 19:50:03,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:50:03,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:50:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:50:03,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:50:20,597 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 19:50:20,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:50:38,661 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 19:50:38,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:50:38,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2018-12-03 19:50:38,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:50:38,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 19:50:38,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 19:50:38,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5066, Invalid=23326, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 19:50:38,681 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 113 states. [2018-12-03 19:50:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:50:48,823 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 19:50:48,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 19:50:48,824 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 57 [2018-12-03 19:50:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:50:48,825 INFO L225 Difference]: With dead ends: 60 [2018-12-03 19:50:48,825 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 19:50:48,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7700 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=5066, Invalid=23326, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 19:50:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 19:50:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 19:50:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 19:50:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 19:50:48,831 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 19:50:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:50:48,831 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 19:50:48,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 19:50:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 19:50:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 19:50:48,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:50:48,832 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-12-03 19:50:48,832 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:50:48,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:50:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-12-03 19:50:48,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:50:48,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:50:48,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:50:48,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:50:48,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:50:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat