java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:39,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:39,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:39,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:39,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:39,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:39,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:39,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:39,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:39,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:39,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:39,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:39,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:39,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:39,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:39,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:39,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:39,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:39,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:39,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:39,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:39,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:39,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:39,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:39,936 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:39,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:39,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:39,939 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:39,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:39,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:39,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:39,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:39,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:39,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:39,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:39,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:39,945 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:41:39,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:39,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:39,960 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:39,960 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:39,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:39,961 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:39,961 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:39,961 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:39,961 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:39,962 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:39,962 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:39,962 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:39,962 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:39,963 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:39,963 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:39,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:39,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:39,964 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:39,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:39,965 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:39,965 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:39,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:39,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:39,966 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:39,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:39,966 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:39,966 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:39,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:39,966 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:39,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:39,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:39,967 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:39,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:39,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:39,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:39,968 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:39,968 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:39,968 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:39,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:39,969 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:39,969 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:40,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:40,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:40,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:40,019 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:40,019 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:40,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl [2018-12-03 15:41:40,020 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl' [2018-12-03 15:41:40,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:40,054 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:40,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:40,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:40,056 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:40,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:40,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:40,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:40,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:40,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/1) ... [2018-12-03 15:41:40,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:40,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:40,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:40,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:40,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (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 15:41:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:40,432 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:40,432 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:40,432 INFO L202 PluginConnector]: Adding new model simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:40 BoogieIcfgContainer [2018-12-03 15:41:40,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:40,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:40,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:40,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:40,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:40" (1/2) ... [2018-12-03 15:41:40,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2d84a4 and model type simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:40, skipping insertion in model container [2018-12-03 15:41:40,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:40" (2/2) ... [2018-12-03 15:41:40,442 INFO L112 eAbstractionObserver]: Analyzing ICFG simple1.i_3.bpl [2018-12-03 15:41:40,452 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:40,461 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:40,479 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:40,511 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:40,512 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:40,512 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:40,512 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:40,512 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:40,512 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:40,513 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:40,513 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:41:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:41:40,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:40,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:41:40,544 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:40,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:41:40,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:40,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:40,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:40,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:40,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:40,880 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 15:41:40,883 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 15:41:40,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:40,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:40,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:40,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:40,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:40,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:40,910 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:41:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:40,971 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:41:40,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:40,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:41:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:40,985 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:41:40,985 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:41:40,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:41:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:41:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:41:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:41:41,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:41:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:41,025 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:41:41,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:41:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:41:41,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:41,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:41:41,026 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:41,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 15:41:41,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:41,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:41,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:41,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:41,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:41,476 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:41:41,478 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 15:41:41,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:41,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:41,479 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:41:41,481 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:41:41,520 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:41,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:41,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:41,765 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:41:41,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:41,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:41,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:41,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:41:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:41,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:41,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:41,928 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 15:41:41,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:42,004 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 15:41:42,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:42,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 15:41:42,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:42,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:41:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:41:42,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:42,026 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 15:41:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:42,051 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:41:42,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:41:42,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 15:41:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:42,052 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:41:42,052 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:41:42,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:41:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:41:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:41:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:41:42,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:41:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:42,057 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:41:42,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:41:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:41:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:41:42,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:42,062 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:41:42,062 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:42,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 15:41:42,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:42,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:42,295 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 15:41:42,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:42,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:42,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:42,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:42,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:42,298 INFO 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 15:41:42,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:42,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:42,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:41:42,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:42,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:42,501 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 15:41:42,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:42,600 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 15:41:42,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:42,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 15:41:42,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:42,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:41:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:41:42,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:41:42,622 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 15:41:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:42,687 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:41:42,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:42,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 15:41:42,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:42,690 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:41:42,690 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:41:42,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:41:42,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:41:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:41:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:41:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:41:42,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:41:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:42,694 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:41:42,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:41:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:41:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:41:42,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:42,695 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:41:42,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:42,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 15:41:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:42,956 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 15:41:42,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:42,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:42,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:42,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:42,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:42,958 INFO 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 15:41:42,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:42,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:42,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:42,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:42,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:42,997 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 15:41:42,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:43,111 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 15:41:43,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:43,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 15:41:43,132 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:43,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:41:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:41:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:41:43,133 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 15:41:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:43,190 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:41:43,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:41:43,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 15:41:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:43,191 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:41:43,191 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:41:43,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:41:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:41:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:41:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:41:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:41:43,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:41:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:43,196 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:41:43,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:41:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:41:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:41:43,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:43,197 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:41:43,197 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:43,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 15:41:43,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:43,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:43,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:43,625 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:41:43,626 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 15:41:43,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:43,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:43,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:43,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:43,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:43,627 INFO 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 15:41:43,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:43,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:43,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:43,760 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 15:41:43,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:43,890 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 15:41:43,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 15:41:43,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:43,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:41:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:41:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:41:43,911 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 15:41:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:43,967 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:41:43,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:41:43,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 15:41:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:43,969 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:41:43,970 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:41:43,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:41:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:41:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:41:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:41:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:41:43,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:41:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:43,975 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:41:43,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:41:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:41:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:41:43,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:43,976 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:41:43,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:43,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:43,976 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 15:41:43,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:43,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:43,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:43,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:43,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:44,166 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 15:41:44,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:44,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:44,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:44,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:44,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:44,168 INFO 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 15:41:44,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:44,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:44,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:41:44,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:44,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:44,227 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 15:41:44,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:44,394 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 15:41:44,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:44,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 15:41:44,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:44,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:41:44,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:41:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:41:44,416 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 15:41:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:44,485 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:41:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:41:44,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 15:41:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:44,486 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:41:44,486 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:41:44,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:41:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:41:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:41:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:41:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:41:44,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:41:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:44,491 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:41:44,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:41:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:41:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:41:44,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:44,492 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:41:44,492 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:44,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:44,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 15:41:44,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:44,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:44,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:44,755 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 15:41:44,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:44,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:44,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:44,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:44,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:44,757 INFO 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 15:41:44,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:44,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:44,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:44,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:44,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:44,898 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 15:41:44,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:45,054 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 15:41:45,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:45,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:41:45,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:45,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:41:45,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:41:45,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:41:45,075 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 15:41:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:45,132 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:41:45,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:41:45,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 15:41:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:45,133 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:41:45,134 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:41:45,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:41:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:41:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:41:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:41:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:41:45,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:41:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:45,139 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:41:45,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:41:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:41:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:41:45,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:45,140 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:41:45,140 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:45,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 15:41:45,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:45,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:45,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:45,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:45,613 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:41:45,614 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 15:41:45,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:45,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:45,615 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:45,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:45,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:45,615 INFO 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 15:41:45,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:45,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:45,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:45,687 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 15:41:45,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:45,874 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 15:41:45,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:45,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 15:41:45,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:45,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:41:45,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:41:45,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:41:45,968 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 15:41:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:46,087 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:41:46,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:41:46,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 15:41:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:46,089 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:41:46,089 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:41:46,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:41:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:41:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:41:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:41:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:41:46,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:41:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:46,093 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:41:46,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:41:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:41:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:41:46,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:46,093 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:41:46,094 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:46,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 15:41:46,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:46,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:46,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:46,245 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 15:41:46,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:46,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:46,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:46,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,247 INFO 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 15:41:46,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:46,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:46,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:41:46,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:46,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:46,356 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 15:41:46,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:46,562 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 15:41:46,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:46,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 15:41:46,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:46,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:41:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:41:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:41:46,585 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 15:41:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:46,689 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:41:46,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:41:46,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 15:41:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:46,691 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:41:46,691 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:41:46,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:41:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:41:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:41:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:41:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:41:46,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 15:41:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:46,696 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:41:46,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:41:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:41:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:41:46,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:46,697 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:41:46,697 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:46,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 15:41:46,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:46,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:46,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:46,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:46,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:46,975 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 15:41:46,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:46,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:46,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:46,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:41:46,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:46,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:47,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:47,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:47,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:47,051 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 15:41:47,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:47,304 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 15:41:47,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:47,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 15:41:47,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:47,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:41:47,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:41:47,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:41:47,325 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 15:41:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:47,441 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 15:41:47,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:41:47,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 15:41:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:47,442 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:41:47,443 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:41:47,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:41:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:41:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:41:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:41:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:41:47,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 15:41:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:47,448 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:41:47,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:41:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:41:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:41:47,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:47,448 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 15:41:47,449 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:47,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 15:41:47,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:47,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:47,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:47,903 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 15:41:47,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:47,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:47,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:47,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:47,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:47,904 INFO 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 15:41:47,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:47,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:47,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:47,943 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 15:41:47,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:48,237 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 15:41:48,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:48,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 15:41:48,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:48,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:41:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:41:48,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:41:48,258 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 15:41:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:48,374 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:41:48,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:41:48,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 15:41:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:48,383 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:41:48,383 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:41:48,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:41:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:41:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:41:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:41:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:41:48,388 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 15:41:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:48,388 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:41:48,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:41:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:41:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:41:48,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:48,389 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 15:41:48,389 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:48,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 15:41:48,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:48,599 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 15:41:48,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:48,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:48,600 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:48,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:48,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:48,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:41:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:48,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:50,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:41:50,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:50,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:50,444 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 15:41:50,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:50,791 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 15:41:50,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:50,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 15:41:50,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:50,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:41:50,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:41:50,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:41:50,812 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 15:41:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:51,538 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 15:41:51,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:41:51,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 15:41:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:51,540 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:41:51,540 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:41:51,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:41:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:41:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:41:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:41:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:41:51,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 15:41:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:51,545 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:41:51,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:41:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:41:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:41:51,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:51,546 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 15:41:51,547 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:51,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 15:41:51,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:51,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:51,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:51,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:51,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:51,841 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 15:41:51,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:51,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:51,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:51,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:51,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:51,842 INFO 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 15:41:51,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:51,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:51,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:51,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:51,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:51,949 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 15:41:51,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:52,463 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 15:41:52,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:52,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 15:41:52,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:52,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:41:52,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:41:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:41:52,484 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 15:41:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:52,784 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:41:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:41:52,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 15:41:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:52,786 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:41:52,786 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:41:52,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:41:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:41:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:41:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:41:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 15:41:52,792 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 15:41:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:52,792 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 15:41:52,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:41:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 15:41:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:41:52,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:52,794 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 15:41:52,794 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:52,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:52,794 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 15:41:52,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:52,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:52,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:52,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:52,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:53,439 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 15:41:53,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:53,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:53,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:53,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 15:41:53,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:53,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 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 15:41:53,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:53,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:53,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:53,549 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 15:41:53,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:54,077 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 15:41:54,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:54,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 15:41:54,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:54,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:41:54,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:41:54,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:41:54,097 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 15:41:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:54,305 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 15:41:54,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:41:54,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:41:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:54,307 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:41:54,307 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:41:54,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:41:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:41:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:41:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:41:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:41:54,312 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 15:41:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:54,313 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:41:54,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:41:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:41:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:41:54,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:54,314 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 15:41:54,314 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:54,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 15:41:54,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:54,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:54,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:54,673 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 15:41:54,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:54,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:54,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:54,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:54,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:54,674 INFO 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 15:41:54,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:54,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:59,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:41:59,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:59,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:59,412 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 15:41:59,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 102 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:49,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:49,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 15:42:49,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:49,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:42:49,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:42:49,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=718, Unknown=20, NotChecked=0, Total=1056 [2018-12-03 15:42:49,769 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 15:42:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:49,962 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:42:49,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:42:49,962 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 15:42:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:49,963 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:42:49,964 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:42:49,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=318, Invalid=718, Unknown=20, NotChecked=0, Total=1056 [2018-12-03 15:42:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:42:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:42:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:42:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:42:49,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 15:42:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:49,969 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:42:49,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:42:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:42:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:42:49,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:49,970 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 15:42:49,970 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:49,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:49,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 15:42:49,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:49,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:49,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:49,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:49,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:50,491 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 15:42:50,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:50,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:50,491 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:50,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:50,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:50,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:42:50,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:50,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:50,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:50,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:50,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:50,552 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 15:42:50,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:51,136 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 15:42:51,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:51,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 15:42:51,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:51,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:42:51,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:42:51,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:42:51,157 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 15:42:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:51,364 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 15:42:51,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:42:51,364 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 15:42:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:51,365 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:42:51,365 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:42:51,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:42:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:42:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:42:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:42:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:42:51,370 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 15:42:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:51,370 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:42:51,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:42:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:42:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:42:51,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:51,371 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 15:42:51,372 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:51,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:51,372 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 15:42:51,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:51,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:51,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:51,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:51,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:51,649 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 15:42:51,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:51,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:51,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:51,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:51,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:51,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:42:51,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:51,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:51,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:51,735 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 15:42:51,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:52,462 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 15:42:52,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:52,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 15:42:52,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:52,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:42:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:42:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:42:52,483 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 15:42:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:52,717 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:42:52,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:42:52,719 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 15:42:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:52,720 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:42:52,720 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:42:52,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:42:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:42:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:42:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:42:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 15:42:52,724 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 15:42:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:52,725 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 15:42:52,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:42:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 15:42:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:42:52,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:52,725 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 15:42:52,726 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:52,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:52,726 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 15:42:52,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:52,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:53,049 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 15:42:53,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:53,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:53,050 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:53,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:53,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:53,050 INFO 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 15:42:53,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:53,060 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:53,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:42:53,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:53,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:53,256 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 15:42:53,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:54,609 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 15:42:54,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:54,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 15:42:54,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:54,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:42:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:42:54,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:42:54,630 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 15:42:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:54,956 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 15:42:54,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:42:54,957 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 15:42:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:54,958 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:42:54,958 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:42:54,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:42:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:42:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:42:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:42:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:42:54,964 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 15:42:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:54,964 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:42:54,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:42:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:42:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:42:54,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:54,965 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 15:42:54,965 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:54,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 15:42:54,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:54,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:54,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:55,572 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 15:42:55,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:55,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:55,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:55,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:55,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:55,574 INFO 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 15:42:55,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:55,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:55,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:55,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:55,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:55,745 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 15:42:55,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:56,974 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 15:42:56,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:56,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 15:42:56,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:56,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:42:56,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:42:56,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:42:56,995 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 15:42:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:57,247 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:42:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:42:57,248 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 15:42:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:57,248 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:42:57,249 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:42:57,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:42:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:42:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:42:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:42:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:42:57,254 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 15:42:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:57,254 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:42:57,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:42:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:42:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:42:57,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:57,255 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 15:42:57,255 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:57,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 15:42:57,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:57,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:57,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:57,640 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 15:42:57,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:57,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:57,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:57,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:57,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:57,641 INFO 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 15:42:57,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:57,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:57,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:57,714 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 15:42:57,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:59,263 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 15:42:59,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:59,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 15:42:59,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:59,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:42:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:42:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:42:59,285 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 15:42:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:59,745 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 15:42:59,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:42:59,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 15:42:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:59,747 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:42:59,747 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:42:59,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:42:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:42:59,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:42:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:42:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:42:59,752 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 15:42:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:59,752 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:42:59,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:42:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:42:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:42:59,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:59,753 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 15:42:59,753 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:59,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:59,753 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 15:42:59,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:59,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:59,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:00,185 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 15:43:00,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:00,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:00,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:00,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:00,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:00,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:43:00,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:00,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:00,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:43:00,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:00,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:00,584 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 15:43:00,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 203 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:42,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:42,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 15:44:42,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:42,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:44:42,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:44:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1371, Unknown=39, NotChecked=0, Total=1980 [2018-12-03 15:44:42,561 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 15:44:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:42,948 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:44:42,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:44:42,948 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 15:44:42,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:42,949 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:44:42,949 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:44:42,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 102.3s TimeCoverageRelationStatistics Valid=570, Invalid=1371, Unknown=39, NotChecked=0, Total=1980 [2018-12-03 15:44:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:44:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:44:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:44:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:44:42,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 15:44:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:42,956 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:44:42,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:44:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:44:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:44:42,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:42,957 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 15:44:42,957 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:42,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 15:44:42,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:42,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:42,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:42,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:42,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:44,108 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 15:44:44,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:44,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:44,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:44,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:44,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:44,110 INFO 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 15:44:44,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:44,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:44,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:44,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:44,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:44,223 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 15:44:44,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:45,292 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 15:44:45,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:45,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 15:44:45,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:45,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:44:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:44:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:44:45,312 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 15:44:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:45,664 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 15:44:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:44:45,665 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 15:44:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:45,665 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:44:45,666 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:44:45,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:44:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:44:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:44:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:44:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:44:45,670 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 15:44:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:45,671 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:44:45,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:44:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:44:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:44:45,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:45,672 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 15:44:45,672 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:45,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 15:44:45,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:45,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:45,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:47,203 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 15:44:47,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:47,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:47,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:47,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:47,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:47,204 INFO 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 15:44:47,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:47,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:47,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:47,271 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 15:44:47,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:48,644 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 15:44:48,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:48,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 15:44:48,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:48,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:44:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:44:48,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:44:48,664 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 15:44:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:49,400 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:44:49,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:44:49,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 15:44:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:49,401 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:44:49,402 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:44:49,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:44:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:44:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:44:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:44:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:44:49,407 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 15:44:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:49,408 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:44:49,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:44:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:44:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:44:49,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:49,408 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 15:44:49,409 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:49,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 15:44:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:49,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:49,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:50,145 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 15:44:50,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:50,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:50,146 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:50,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:50,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:50,146 INFO 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 15:44:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:50,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:59,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:44:59,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:59,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:59,327 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 15:44:59,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:01,076 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 15:45:01,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:01,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 15:45:01,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:01,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:45:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:45:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:45:01,098 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 15:45:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:01,724 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 15:45:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:45:01,725 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 15:45:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:01,725 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:45:01,725 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:45:01,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:45:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:45:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:45:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:45:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:45:01,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 15:45:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:01,732 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:45:01,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:45:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:45:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:45:01,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:01,733 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 15:45:01,733 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:01,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:01,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 15:45:01,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:01,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:01,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:01,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:01,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:02,498 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 15:45:02,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:02,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:02,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:02,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:02,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:02,499 INFO 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 15:45:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:02,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:02,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:02,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:02,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:02,577 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 15:45:02,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:04,136 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 15:45:04,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:04,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 15:45:04,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:04,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:45:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:45:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:45:04,156 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 15:45:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:04,587 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:45:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:45:04,588 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 15:45:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:04,588 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:45:04,588 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:45:04,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:45:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:45:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:45:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:45:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 15:45:04,594 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 15:45:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:04,594 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 15:45:04,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:45:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 15:45:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:45:04,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:04,595 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 15:45:04,595 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:04,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 15:45:04,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:04,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:04,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:05,647 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 15:45:05,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:05,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:05,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:05,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:05,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:05,648 INFO 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 15:45:05,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:05,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:05,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:05,789 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 15:45:05,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:07,260 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 15:45:07,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:07,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 15:45:07,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:07,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:45:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:45:07,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:45:07,282 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 15:45:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:07,844 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 15:45:07,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:45:07,845 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 15:45:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:07,846 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:45:07,846 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:45:07,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:45:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:45:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:45:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:45:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:45:07,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 15:45:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:07,851 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:45:07,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:45:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:45:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:45:07,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:07,851 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 15:45:07,852 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:07,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 15:45:07,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:07,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:07,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:07,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:08,415 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 15:45:08,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:08,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:08,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:08,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:08,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:08,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:45:08,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:08,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:49,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:45:49,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:49,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:49,550 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 15:45:49,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:04,175 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:47:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 342 refuted. 9 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:53,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:53,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 15:47:53,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:53,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:47:53,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:47:53,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2253, Unknown=45, NotChecked=0, Total=3192 [2018-12-03 15:47:53,218 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 15:47:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:53,740 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:47:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:47:53,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 15:47:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:53,743 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:47:53,743 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:47:53,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 124.2s TimeCoverageRelationStatistics Valid=894, Invalid=2253, Unknown=45, NotChecked=0, Total=3192 [2018-12-03 15:47:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:47:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:47:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:47:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:47:53,748 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 15:47:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:53,748 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:47:53,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:47:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:47:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:47:53,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:53,748 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 15:47:53,748 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:53,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 15:47:53,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:53,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:53,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:54,598 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 15:47:54,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:54,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:54,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:54,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:54,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:54,599 INFO 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 15:47:54,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:54,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:54,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:54,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:54,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:54,697 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 15:47:54,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:56,494 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 15:47:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:56,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 15:47:56,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:56,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:47:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:47:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:47:56,515 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 15:47:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:57,110 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 15:47:57,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:47:57,110 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 15:47:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:57,111 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:47:57,111 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:47:57,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:47:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:47:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:47:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:47:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:47:57,117 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 15:47:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:57,117 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:47:57,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:47:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:47:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:47:57,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:57,118 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 15:47:57,118 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:57,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 15:47:57,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:57,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:57,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:57,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:57,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:57,776 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 15:47:57,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:57,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:57,776 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:57,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:57,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:57,776 INFO 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 15:47:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:57,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:57,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:57,857 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 15:47:57,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:59,677 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 15:47:59,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:59,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 15:47:59,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:59,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:47:59,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:47:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:47:59,698 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 15:48:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:00,267 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:48:00,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:48:00,268 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 15:48:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:00,268 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:48:00,269 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:48:00,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:48:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:48:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:48:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:48:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 15:48:00,275 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 15:48:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:00,275 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 15:48:00,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:48:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 15:48:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:48:00,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:00,276 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 15:48:00,276 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:00,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:00,276 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 15:48:00,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:00,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:00,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:00,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:00,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:00,924 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 15:48:00,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:00,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:00,925 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:00,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:00,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:00,926 INFO 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 15:48:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:00,936 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:51,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:49:51,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:51,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:52,043 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 15:49:52,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:54,095 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 15:49:54,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:54,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 15:49:54,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:54,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:49:54,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:49:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:49:54,117 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 15:49:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:54,834 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 15:49:54,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:49:54,834 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 15:49:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:54,835 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:49:54,835 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:49:54,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:49:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:49:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:49:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:49:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:49:54,840 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 15:49:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:54,840 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:49:54,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:49:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:49:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:49:54,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:54,840 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 15:49:54,841 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:54,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 15:49:54,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:54,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:54,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:54,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:55,609 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 15:49:55,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:55,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:55,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:55,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:55,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:55,610 INFO 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 15:49:55,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:55,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:55,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:55,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:55,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:55,685 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 15:49:55,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:57,728 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 15:49:57,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:57,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2018-12-03 15:49:57,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:57,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:49:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:49:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:49:57,749 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 15:49:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:58,488 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 15:49:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:49:58,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 15:49:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:58,489 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:49:58,489 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:49:58,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:49:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:49:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:49:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:49:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 15:49:58,494 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 15:49:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:58,494 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 15:49:58,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:49:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 15:49:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:49:58,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:58,495 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 15:49:58,495 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:58,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 15:49:58,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:58,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:58,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:59,464 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 15:49:59,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:59,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:59,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:59,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:59,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:59,465 INFO 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 15:49:59,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:59,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:59,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:59,566 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 15:49:59,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:01,770 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 15:50:01,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:01,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 15:50:01,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:01,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:50:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:50:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:50:01,791 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 15:50:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:02,471 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 15:50:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:50:02,471 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 15:50:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:02,472 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:50:02,472 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:50:02,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:50:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:50:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:50:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:50:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 15:50:02,478 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 15:50:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:02,478 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 15:50:02,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:50:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 15:50:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:50:02,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:02,479 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 15:50:02,479 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:02,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 15:50:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:02,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:02,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:03,147 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 15:50:03,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:03,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:03,148 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:03,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:03,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:03,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:50:03,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:03,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:52,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:51:52,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:53,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:53,295 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 15:51:53,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:56,497 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:52:31,163 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:55:35,226 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 17