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/down.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:33:21,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:33:21,135 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:33:21,147 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:33:21,148 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:33:21,149 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:33:21,150 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:33:21,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:33:21,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:33:21,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:33:21,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:33:21,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:33:21,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:33:21,159 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:33:21,160 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:33:21,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:33:21,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:33:21,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:33:21,166 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:33:21,167 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:33:21,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:33:21,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:33:21,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:33:21,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:33:21,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:33:21,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:33:21,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:33:21,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:33:21,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:33:21,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:33:21,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:33:21,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:33:21,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:33:21,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:33:21,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:33:21,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:33:21,182 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:33:21,196 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:33:21,196 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:33:21,197 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:33:21,197 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:33:21,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:33:21,198 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:33:21,198 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:33:21,198 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:33:21,199 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:33:21,199 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:33:21,199 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:33:21,199 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:33:21,200 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:33:21,200 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:33:21,200 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:33:21,201 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:33:21,201 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:33:21,202 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:33:21,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:33:21,202 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:33:21,202 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:33:21,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:33:21,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:33:21,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:33:21,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:33:21,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:33:21,204 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:33:21,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:33:21,204 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:33:21,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:33:21,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:33:21,205 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:33:21,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:33:21,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:33:21,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:33:21,206 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:33:21,206 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:33:21,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:33:21,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:33:21,206 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:33:21,207 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:33:21,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:33:21,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:33:21,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:33:21,258 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:33:21,258 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:33:21,259 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl [2018-12-03 15:33:21,260 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl' [2018-12-03 15:33:21,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:33:21,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:33:21,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:33:21,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:33:21,302 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:33:21,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:33:21,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:33:21,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:33:21,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:33:21,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/1) ... [2018-12-03 15:33:21,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:33:21,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:33:21,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:33:21,362 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:33:21,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (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:33:21,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:33:21,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:33:21,718 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:33:21,718 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 15:33:21,719 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:33:21 BoogieIcfgContainer [2018-12-03 15:33:21,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:33:21,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:33:21,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:33:21,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:33:21,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:33:21" (1/2) ... [2018-12-03 15:33:21,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568d99c4 and model type down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:33:21, skipping insertion in model container [2018-12-03 15:33:21,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:33:21" (2/2) ... [2018-12-03 15:33:21,728 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bpl [2018-12-03 15:33:21,738 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:33:21,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:33:21,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:33:21,800 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:33:21,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:33:21,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:33:21,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:33:21,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:33:21,801 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:33:21,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:33:21,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:33:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-03 15:33:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:33:21,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:21,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:33:21,830 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:21,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:21,839 INFO L82 PathProgramCache]: Analyzing trace with hash 28787237, now seen corresponding path program 1 times [2018-12-03 15:33:21,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:21,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:21,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:22,068 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:33:22,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:33:22,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:33:22,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:33:22,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:33:22,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:33:22,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:33:22,122 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-12-03 15:33:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:22,327 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-03 15:33:22,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:33:22,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 15:33:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:22,342 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:33:22,342 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:33:22,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:33:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:33:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:33:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:33:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:33:22,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 15:33:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:22,383 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:33:22,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:33:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:33:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:33:22,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:22,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:33:22,384 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:22,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:22,385 INFO L82 PathProgramCache]: Analyzing trace with hash 894126414, now seen corresponding path program 1 times [2018-12-03 15:33:22,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:22,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:22,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:22,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:22,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:22,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:33:22,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:33:22,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:33:22,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:33:22,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:33:22,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:33:22,492 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-12-03 15:33:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:22,618 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 15:33:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:33:22,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 15:33:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:22,620 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:33:22,620 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:33:22,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:33:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:33:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 15:33:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:33:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 15:33:22,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 15:33:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:22,626 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 15:33:22,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:33:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 15:33:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:33:22,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:22,627 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:33:22,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:22,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash 261957866, now seen corresponding path program 1 times [2018-12-03 15:33:22,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:22,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:22,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:22,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:22,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:22,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:22,736 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:33:22,738 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17] [2018-12-03 15:33:22,779 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:33:22,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:33:23,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:33:23,086 INFO L272 AbstractInterpreter]: Visited 7 different actions 29 times. Merged at 6 different actions 19 times. Widened at 2 different actions 2 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:33:23,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:23,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:33:23,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:23,133 INFO 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:33:23,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:23,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:23,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:23,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:23,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:23,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 15:33:23,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:23,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:33:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:33:23,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:33:23,335 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-12-03 15:33:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:23,590 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 15:33:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:33:23,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-12-03 15:33:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:23,593 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:33:23,593 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:33:23,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:33:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:33:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:33:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:33:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 15:33:23,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-12-03 15:33:23,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:23,602 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 15:33:23,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:33:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 15:33:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:33:23,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:23,603 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:33:23,604 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:23,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:23,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1187669281, now seen corresponding path program 2 times [2018-12-03 15:33:23,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:23,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:23,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:23,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:23,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:23,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:23,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:23,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:23,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:23,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:23,817 INFO 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:33:23,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:23,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:23,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:33:23,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:23,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:23,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:23,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:23,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-12-03 15:33:23,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:23,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:33:23,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:33:23,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:33:23,966 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-12-03 15:33:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:24,098 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-12-03 15:33:24,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:33:24,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 15:33:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:24,100 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:33:24,101 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:33:24,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:33:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:33:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 15:33:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:33:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 15:33:24,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2018-12-03 15:33:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:24,106 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 15:33:24,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:33:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 15:33:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:33:24,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:24,107 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2018-12-03 15:33:24,107 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:24,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:24,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1111188483, now seen corresponding path program 3 times [2018-12-03 15:33:24,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:24,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:24,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:24,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:24,309 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:24,310 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:24,310 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:33:24,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:24,310 INFO 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:33:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:24,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:24,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:24,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:24,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:24,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:24,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:24,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:33:24,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:24,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:33:24,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:33:24,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:33:24,647 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2018-12-03 15:33:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:24,818 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-03 15:33:24,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:33:24,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-12-03 15:33:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:24,818 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:33:24,819 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:33:24,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:33:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:33:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:33:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:33:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 15:33:24,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-12-03 15:33:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:24,823 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 15:33:24,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:33:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 15:33:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:33:24,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:24,824 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2018-12-03 15:33:24,825 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:24,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:24,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1227431834, now seen corresponding path program 4 times [2018-12-03 15:33:24,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:24,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:24,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:24,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:24,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:24,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:24,967 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:33:24,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:24,968 INFO 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:33:24,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:24,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:25,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:25,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:25,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:25,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2018-12-03 15:33:25,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:25,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:33:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:33:25,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:33:25,116 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-12-03 15:33:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:25,271 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 15:33:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:33:25,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:33:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:25,272 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:33:25,272 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:33:25,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:33:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:33:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 15:33:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:33:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 15:33:25,277 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-03 15:33:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:25,278 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 15:33:25,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:33:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 15:33:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:33:25,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:25,279 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2018-12-03 15:33:25,279 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:25,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1553947138, now seen corresponding path program 5 times [2018-12-03 15:33:25,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:25,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:25,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:25,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:25,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:25,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:25,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:25,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:25,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:25,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:25,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:25,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:25,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:25,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:33:25,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:25,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:25,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:25,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:25,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 15:33:25,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:25,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:33:25,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:33:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:33:25,644 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2018-12-03 15:33:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:25,908 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-03 15:33:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:33:25,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-12-03 15:33:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:25,909 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:33:25,909 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:33:25,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:33:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:33:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:33:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:33:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-03 15:33:25,914 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-03 15:33:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:25,914 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-03 15:33:25,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:33:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-03 15:33:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:33:25,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:25,915 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2018-12-03 15:33:25,915 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:25,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash 291918073, now seen corresponding path program 6 times [2018-12-03 15:33:25,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:25,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:25,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:25,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:25,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:26,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:26,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:26,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:26,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:26,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:26,030 INFO 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:33:26,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:26,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:26,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:26,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:26,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:26,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:26,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:26,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2018-12-03 15:33:26,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:26,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:33:26,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:33:26,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:33:26,313 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-12-03 15:33:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:26,438 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-03 15:33:26,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:33:26,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 15:33:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:26,439 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:33:26,439 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:33:26,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:33:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:33:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 15:33:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:33:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-03 15:33:26,445 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-12-03 15:33:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:26,446 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-03 15:33:26,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:33:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-03 15:33:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:33:26,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:26,447 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2018-12-03 15:33:26,447 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:26,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1360327125, now seen corresponding path program 7 times [2018-12-03 15:33:26,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:26,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:26,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:26,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:26,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:26,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:26,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:26,584 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:33:26,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:26,584 INFO 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:33:26,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:26,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:26,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:26,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:26,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:26,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 15:33:26,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:26,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:33:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:33:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:33:26,743 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-12-03 15:33:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:26,901 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-03 15:33:26,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:33:26,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-12-03 15:33:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:26,902 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:33:26,902 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:33:26,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:33:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:33:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:33:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:33:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 15:33:26,908 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-12-03 15:33:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:26,908 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 15:33:26,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:33:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 15:33:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:33:26,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:26,909 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2018-12-03 15:33:26,909 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:26,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1898806402, now seen corresponding path program 8 times [2018-12-03 15:33:26,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:26,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:26,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:26,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:26,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:27,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:27,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:27,034 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:27,034 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:33:27,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:27,035 INFO 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:33:27,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:27,045 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:27,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:33:27,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:27,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:27,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:27,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:27,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2018-12-03 15:33:27,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:27,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:33:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:33:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:33:27,244 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2018-12-03 15:33:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:27,367 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 15:33:27,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:33:27,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-12-03 15:33:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:27,369 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:33:27,369 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:33:27,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:33:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:33:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-12-03 15:33:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:33:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 15:33:27,375 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 15:33:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:27,375 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 15:33:27,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:33:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 15:33:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:33:27,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:27,376 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2018-12-03 15:33:27,376 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:27,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:27,376 INFO L82 PathProgramCache]: Analyzing trace with hash 608081690, now seen corresponding path program 9 times [2018-12-03 15:33:27,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:27,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:27,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:27,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:27,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:27,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:27,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:27,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:27,510 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:33:27,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:27,510 INFO 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:33:27,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:27,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:27,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:27,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:27,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:27,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:27,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:27,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 15:33:27,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:27,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:33:27,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:33:27,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:33:27,825 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 14 states. [2018-12-03 15:33:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:28,304 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-12-03 15:33:28,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:33:28,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 15:33:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:28,305 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:33:28,305 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:33:28,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:33:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:33:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:33:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:33:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-03 15:33:28,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-12-03 15:33:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:28,311 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-03 15:33:28,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:33:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-03 15:33:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:33:28,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:28,311 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2018-12-03 15:33:28,312 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:28,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash -208127791, now seen corresponding path program 10 times [2018-12-03 15:33:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:28,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:28,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:28,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:28,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:28,751 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:28,751 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:33:28,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:28,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:28,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:28,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:28,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:29,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:29,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 11 [2018-12-03 15:33:29,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:29,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:33:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:33:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:33:29,179 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-12-03 15:33:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:29,409 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-03 15:33:29,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:33:29,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-12-03 15:33:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:29,411 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:33:29,411 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:33:29,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:33:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:33:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-12-03 15:33:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:33:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-03 15:33:29,419 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-12-03 15:33:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:29,419 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-03 15:33:29,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:33:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-03 15:33:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:33:29,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:29,420 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2018-12-03 15:33:29,421 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:29,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1852588973, now seen corresponding path program 11 times [2018-12-03 15:33:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:29,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:29,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:29,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:29,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:29,596 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:29,597 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:33:29,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:29,597 INFO 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:33:29,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:29,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:29,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:33:29,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:29,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:29,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:29,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:29,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 15:33:29,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:29,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:33:29,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:33:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:33:29,837 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 16 states. [2018-12-03 15:33:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:30,074 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-03 15:33:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:33:30,074 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-12-03 15:33:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:30,075 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:33:30,075 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:33:30,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:33:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:33:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:33:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:33:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 15:33:30,081 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-12-03 15:33:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:30,082 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 15:33:30,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:33:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 15:33:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:33:30,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:30,083 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2018-12-03 15:33:30,083 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:30,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash -34196842, now seen corresponding path program 12 times [2018-12-03 15:33:30,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:30,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:30,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:30,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:30,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:30,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:30,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:30,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:30,231 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:33:30,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:30,231 INFO 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:33:30,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:30,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:30,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:30,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:30,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:30,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:30,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:30,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 12 [2018-12-03 15:33:30,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:30,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:33:30,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:33:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:33:30,443 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 15:33:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:30,589 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 15:33:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:33:30,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 15:33:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:30,591 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:33:30,591 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:33:30,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:33:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:33:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-03 15:33:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:33:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 15:33:30,599 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 15:33:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:30,599 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 15:33:30,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:33:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 15:33:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:33:30,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:30,600 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2018-12-03 15:33:30,600 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:30,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1496506418, now seen corresponding path program 13 times [2018-12-03 15:33:30,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:30,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:30,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:30,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:31,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:31,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:31,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:31,239 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:33:31,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:31,239 INFO 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:33:31,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:31,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:31,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:31,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:31,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:31,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 15:33:31,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:31,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:33:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:33:31,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:33:31,482 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2018-12-03 15:33:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:31,809 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-03 15:33:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:33:31,809 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-12-03 15:33:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:31,810 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:33:31,810 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:33:31,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:33:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:33:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:33:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:33:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-03 15:33:31,816 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-03 15:33:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:31,817 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-03 15:33:31,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:33:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-03 15:33:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:33:31,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:31,818 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2018-12-03 15:33:31,818 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:31,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash 497294505, now seen corresponding path program 14 times [2018-12-03 15:33:31,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:31,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:31,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:31,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:31,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:31,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:31,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:31,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:31,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:31,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:31,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:32,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:32,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:32,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:33:32,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:32,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:32,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:32,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:32,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 13 [2018-12-03 15:33:32,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:32,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:33:32,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:33:32,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:33:32,359 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-12-03 15:33:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:32,573 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-03 15:33:32,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:33:32,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-03 15:33:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:32,575 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:33:32,575 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:33:32,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:33:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:33:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-03 15:33:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:33:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-03 15:33:32,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2018-12-03 15:33:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:32,584 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-03 15:33:32,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:33:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-03 15:33:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:33:32,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:32,586 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2018-12-03 15:33:32,586 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:32,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1158582661, now seen corresponding path program 15 times [2018-12-03 15:33:32,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:32,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:32,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:32,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:32,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:32,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:32,889 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:33:32,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:32,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:33:32,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:32,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:32,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:32,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:32,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:32,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:33,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:33,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 15:33:33,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:33,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:33:33,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:33:33,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:33:33,196 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 20 states. [2018-12-03 15:33:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:33,549 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-03 15:33:33,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:33:33,549 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-12-03 15:33:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:33,550 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:33:33,550 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:33:33,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 17 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:33:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:33:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:33:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:33:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 15:33:33,557 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-12-03 15:33:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:33,558 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 15:33:33,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:33:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 15:33:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:33:33,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:33,559 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2018-12-03 15:33:33,559 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:33,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2054811054, now seen corresponding path program 16 times [2018-12-03 15:33:33,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:33,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:33,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:33,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:33,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:33,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:33,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:33,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:33,768 INFO 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:33:33,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:33,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:33,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:33,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:34,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 14 [2018-12-03 15:33:34,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:34,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:33:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:33:34,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:33:34,001 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2018-12-03 15:33:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:34,162 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 15:33:34,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:33:34,163 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-12-03 15:33:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:34,164 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:33:34,164 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:33:34,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:33:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:33:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-03 15:33:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:33:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 15:33:34,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-03 15:33:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:34,173 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 15:33:34,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:33:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 15:33:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:33:34,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:34,174 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2018-12-03 15:33:34,174 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:34,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1011600054, now seen corresponding path program 17 times [2018-12-03 15:33:34,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:34,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:34,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:34,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:34,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:34,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:34,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:34,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:34,879 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:33:34,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:34,879 INFO 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:33:34,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:34,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:34,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:33:34,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:34,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:34,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:35,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:35,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 15:33:35,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:35,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:33:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:33:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:33:35,398 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2018-12-03 15:33:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:35,709 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-03 15:33:35,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:33:35,710 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-12-03 15:33:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:35,710 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:33:35,710 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:33:35,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 19 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:33:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:33:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:33:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:33:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-03 15:33:35,724 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-12-03 15:33:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:35,724 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-03 15:33:35,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:33:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-03 15:33:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:33:35,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:35,728 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2018-12-03 15:33:35,728 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:35,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1011743873, now seen corresponding path program 18 times [2018-12-03 15:33:35,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:35,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:35,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:35,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:35,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:36,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:36,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:36,731 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:36,731 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:33:36,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:36,731 INFO 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:33:36,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:36,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:36,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:36,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:36,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:36,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:36,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:36,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 15 [2018-12-03 15:33:36,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:36,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:33:36,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:33:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:33:36,971 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 16 states. [2018-12-03 15:33:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:37,171 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-03 15:33:37,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:33:37,172 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-12-03 15:33:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:37,172 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:33:37,173 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:33:37,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=262, Invalid=440, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:33:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:33:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-03 15:33:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:33:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-03 15:33:37,181 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2018-12-03 15:33:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:37,182 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-03 15:33:37,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:33:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-03 15:33:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:33:37,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:37,183 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2018-12-03 15:33:37,183 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:37,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:37,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1623186269, now seen corresponding path program 19 times [2018-12-03 15:33:37,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:37,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:37,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:37,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:37,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:37,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:37,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:37,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:37,504 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:33:37,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:37,505 INFO 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:33:37,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:37,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:37,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:37,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:37,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:37,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 15:33:37,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:37,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:33:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:33:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:33:37,835 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 24 states. [2018-12-03 15:33:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:38,558 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-03 15:33:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:33:38,558 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-12-03 15:33:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:38,559 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:33:38,559 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:33:38,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 21 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:33:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:33:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:33:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:33:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 15:33:38,565 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-12-03 15:33:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:38,565 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 15:33:38,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:33:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 15:33:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:33:38,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:38,566 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2018-12-03 15:33:38,567 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:38,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash -803883834, now seen corresponding path program 20 times [2018-12-03 15:33:38,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:38,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:38,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:38,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:38,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:38,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:38,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:38,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:38,710 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:33:38,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:38,710 INFO 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:33:38,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:38,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:38,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:33:38,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:38,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:38,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:39,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:39,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 16 [2018-12-03 15:33:39,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:39,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:33:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:33:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:33:39,194 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-12-03 15:33:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:39,519 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 15:33:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:33:39,522 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-03 15:33:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:39,523 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:33:39,523 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:33:39,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:33:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:33:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 15:33:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:33:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 15:33:39,532 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-03 15:33:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:39,533 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 15:33:39,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:33:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 15:33:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:33:39,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:39,534 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2018-12-03 15:33:39,534 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:39,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash 561682018, now seen corresponding path program 21 times [2018-12-03 15:33:39,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:39,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:39,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:39,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:39,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:39,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:39,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:39,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:39,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:39,861 INFO 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:33:39,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:39,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:39,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:39,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:39,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:39,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:40,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 15:33:40,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:40,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:33:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:33:40,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:33:40,352 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2018-12-03 15:33:40,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:40,699 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 15:33:40,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:33:40,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-12-03 15:33:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:40,699 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:33:40,699 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:33:40,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 23 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:33:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:33:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:33:40,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:33:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-03 15:33:40,708 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-03 15:33:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:40,708 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-03 15:33:40,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:33:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-03 15:33:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:33:40,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:40,709 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2018-12-03 15:33:40,709 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:40,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1490671705, now seen corresponding path program 22 times [2018-12-03 15:33:40,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:40,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:40,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:40,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:40,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:41,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:41,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:41,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:41,060 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:33:41,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:41,061 INFO 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:33:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:41,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:41,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:41,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:41,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:41,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 17 [2018-12-03 15:33:41,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:41,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:33:41,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:33:41,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:33:41,558 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 18 states. [2018-12-03 15:33:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:41,904 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-03 15:33:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:33:41,904 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-03 15:33:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:41,905 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:33:41,905 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:33:41,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=583, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:33:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:33:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-03 15:33:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:33:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-03 15:33:41,914 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2018-12-03 15:33:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:41,914 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-03 15:33:41,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:33:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-03 15:33:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:33:41,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:41,915 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2018-12-03 15:33:41,915 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:41,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:41,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1983635147, now seen corresponding path program 23 times [2018-12-03 15:33:41,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:41,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:41,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:41,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:42,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:42,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:42,311 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:42,311 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:33:42,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:42,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:42,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:42,323 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:42,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:33:42,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:42,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:42,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:44,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:44,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 15:33:44,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:44,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:33:44,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:33:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:33:44,044 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2018-12-03 15:33:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:44,517 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 15:33:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:33:44,518 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2018-12-03 15:33:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:44,518 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:33:44,518 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:33:44,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 56 SyntacticMatches, 25 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:33:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:33:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:33:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:33:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 15:33:44,525 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-12-03 15:33:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:44,526 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 15:33:44,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:33:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 15:33:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:33:44,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:44,527 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2018-12-03 15:33:44,527 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:44,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:44,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1073842142, now seen corresponding path program 24 times [2018-12-03 15:33:44,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:44,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:44,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:44,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:44,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:44,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:44,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:44,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:44,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:44,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:44,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:44,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:44,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:44,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:44,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:44,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:44,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:45,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:45,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 18 [2018-12-03 15:33:45,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:45,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:33:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:33:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:33:45,018 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 19 states. [2018-12-03 15:33:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:45,272 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 15:33:45,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:33:45,273 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-12-03 15:33:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:45,273 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:33:45,273 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:33:45,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:33:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:33:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-03 15:33:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:33:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 15:33:45,284 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 15:33:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:45,284 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 15:33:45,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:33:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 15:33:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:33:45,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:45,285 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2018-12-03 15:33:45,285 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:45,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080634, now seen corresponding path program 25 times [2018-12-03 15:33:45,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:45,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:45,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:45,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:45,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:45,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:45,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:45,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:45,768 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:33:45,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:45,768 INFO 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:33:45,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:45,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:45,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:45,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:46,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:46,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 15:33:46,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:46,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:33:46,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:33:46,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:33:46,093 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 30 states. [2018-12-03 15:33:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:46,831 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 15:33:46,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:33:46,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-12-03 15:33:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:46,831 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:33:46,831 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:33:46,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 60 SyntacticMatches, 27 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:33:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:33:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:33:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:33:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-03 15:33:46,840 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-12-03 15:33:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:46,841 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-03 15:33:46,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:33:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-03 15:33:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:33:46,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:46,841 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2018-12-03 15:33:46,842 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:46,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:46,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1190416335, now seen corresponding path program 26 times [2018-12-03 15:33:46,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:46,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:46,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:46,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:46,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:47,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:47,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:47,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:47,107 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:33:47,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:47,107 INFO 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:33:47,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:47,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:47,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:33:47,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:47,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:47,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:47,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:47,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 19 [2018-12-03 15:33:47,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:47,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:33:47,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:33:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:33:47,538 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 20 states. [2018-12-03 15:33:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:47,811 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-03 15:33:47,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:33:47,811 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-12-03 15:33:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:47,812 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:33:47,812 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:33:47,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=444, Invalid=746, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:33:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:33:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-12-03 15:33:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:33:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-03 15:33:47,821 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-12-03 15:33:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:47,821 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-03 15:33:47,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:33:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-03 15:33:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:33:47,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:47,822 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2018-12-03 15:33:47,822 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:47,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:47,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1528863987, now seen corresponding path program 27 times [2018-12-03 15:33:47,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:47,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:47,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:47,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:47,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:48,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:48,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:48,198 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:48,198 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:33:48,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:48,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:48,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:48,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:48,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:48,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:48,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:48,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:48,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 15:33:48,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:48,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:33:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:33:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:33:48,595 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 32 states. [2018-12-03 15:33:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:49,105 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-12-03 15:33:49,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:33:49,105 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2018-12-03 15:33:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:49,106 INFO L225 Difference]: With dead ends: 82 [2018-12-03 15:33:49,106 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:33:49,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 64 SyntacticMatches, 29 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:33:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:33:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:33:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:33:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 15:33:49,114 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-12-03 15:33:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:49,114 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 15:33:49,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:33:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 15:33:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:33:49,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:49,115 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2018-12-03 15:33:49,115 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:49,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:49,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1594530058, now seen corresponding path program 28 times [2018-12-03 15:33:49,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:49,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:49,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:49,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:49,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:49,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:49,389 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:33:49,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:49,389 INFO 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:33:49,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:49,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:49,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:49,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:49,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:49,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 20 [2018-12-03 15:33:49,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:49,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:33:49,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:33:49,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:33:49,701 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-12-03 15:33:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:49,973 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 15:33:49,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:33:49,974 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-12-03 15:33:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:49,975 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:33:49,975 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:33:49,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:33:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:33:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-12-03 15:33:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:33:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 15:33:49,984 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 15:33:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:49,984 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 15:33:49,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:33:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 15:33:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:33:49,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:49,984 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2018-12-03 15:33:49,985 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:49,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 959872146, now seen corresponding path program 29 times [2018-12-03 15:33:49,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:49,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:49,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:49,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:49,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:50,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:50,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:50,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:50,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:50,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:50,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 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:33:50,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:50,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:50,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:33:50,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:50,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:50,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:50,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:50,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 15:33:50,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:50,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:33:50,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:33:50,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:33:50,853 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 34 states. [2018-12-03 15:33:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:51,659 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-12-03 15:33:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:33:51,659 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 50 [2018-12-03 15:33:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:51,659 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:33:51,660 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:33:51,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 68 SyntacticMatches, 31 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:33:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:33:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:33:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:33:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-03 15:33:51,669 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-03 15:33:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:51,669 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-03 15:33:51,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:33:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-03 15:33:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:33:51,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:51,669 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2018-12-03 15:33:51,670 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:51,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:51,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1087929335, now seen corresponding path program 30 times [2018-12-03 15:33:51,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:51,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:51,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:52,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:52,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:52,676 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:52,676 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:33:52,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:52,676 INFO 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:33:52,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:52,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:52,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:52,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:52,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:52,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:53,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 21 [2018-12-03 15:33:53,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:53,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:33:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:33:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:33:53,041 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 22 states. [2018-12-03 15:33:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:53,394 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-12-03 15:33:53,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:33:53,394 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-12-03 15:33:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:53,395 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:33:53,395 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:33:53,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=553, Invalid=929, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:33:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:33:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-03 15:33:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:33:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-03 15:33:53,409 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2018-12-03 15:33:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:53,409 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-03 15:33:53,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:33:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-03 15:33:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:33:53,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:53,410 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2018-12-03 15:33:53,410 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:53,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1823104795, now seen corresponding path program 31 times [2018-12-03 15:33:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:53,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:53,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:53,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:53,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:53,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:53,884 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:33:53,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:53,884 INFO 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:33:53,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:53,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:53,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:53,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:54,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:54,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 15:33:54,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:54,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:33:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:33:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:33:54,343 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 36 states. [2018-12-03 15:33:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:55,134 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 15:33:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:33:55,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2018-12-03 15:33:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:55,134 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:33:55,134 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:33:55,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 72 SyntacticMatches, 33 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:33:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:33:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:33:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:33:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 15:33:55,144 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2018-12-03 15:33:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:55,144 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 15:33:55,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:33:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 15:33:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:33:55,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:55,145 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2018-12-03 15:33:55,145 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:55,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2133414414, now seen corresponding path program 32 times [2018-12-03 15:33:55,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:55,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:55,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:55,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:55,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:55,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:55,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:55,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:55,430 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:33:55,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:55,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:55,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:55,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:55,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:33:55,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:55,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:55,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:55,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:55,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 22 [2018-12-03 15:33:55,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:55,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:33:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:33:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:33:55,805 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2018-12-03 15:33:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:56,118 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 15:33:56,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:33:56,118 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-12-03 15:33:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:56,119 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:33:56,120 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:33:56,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 88 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:33:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:33:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-12-03 15:33:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:33:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 15:33:56,132 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-03 15:33:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:56,132 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 15:33:56,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:33:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 15:33:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:33:56,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:56,133 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2018-12-03 15:33:56,133 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:56,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1511784874, now seen corresponding path program 33 times [2018-12-03 15:33:56,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:56,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:56,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:56,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:56,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:56,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:56,956 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:33:56,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:56,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:33:56,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:56,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:57,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:57,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:57,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:57,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:57,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 15:33:57,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:57,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:33:57,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:33:57,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:33:57,417 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 38 states. [2018-12-03 15:33:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:58,106 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-12-03 15:33:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:33:58,106 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 56 [2018-12-03 15:33:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:58,107 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:33:58,107 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:33:58,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 76 SyntacticMatches, 35 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:33:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:33:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:33:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:33:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-03 15:33:58,117 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-12-03 15:33:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:58,117 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-03 15:33:58,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:33:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-03 15:33:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:33:58,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:58,118 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2018-12-03 15:33:58,118 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:58,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:58,118 INFO L82 PathProgramCache]: Analyzing trace with hash -906931231, now seen corresponding path program 34 times [2018-12-03 15:33:58,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:58,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:58,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:58,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:58,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:58,677 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:58,677 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:33:58,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:58,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:33:58,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:58,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:58,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:58,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:59,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:59,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 23 [2018-12-03 15:33:59,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:59,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:33:59,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:33:59,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:33:59,368 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 24 states. [2018-12-03 15:33:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:59,754 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-12-03 15:33:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:33:59,755 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-12-03 15:33:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:59,755 INFO L225 Difference]: With dead ends: 66 [2018-12-03 15:33:59,755 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:33:59,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=674, Invalid=1132, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:33:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:33:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-03 15:33:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:33:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 15:33:59,765 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-12-03 15:33:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:59,765 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 15:33:59,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:33:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 15:33:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:33:59,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:59,766 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2018-12-03 15:33:59,766 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:59,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 317381309, now seen corresponding path program 35 times [2018-12-03 15:33:59,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:59,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:59,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:00,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:00,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:00,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:00,375 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:34:00,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:00,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:00,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:00,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:00,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:34:00,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:00,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:00,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:00,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:00,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 15:34:00,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:00,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:34:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:34:00,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:34:00,968 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 40 states. [2018-12-03 15:34:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:01,986 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 15:34:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:34:01,987 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2018-12-03 15:34:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:01,987 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:34:01,987 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:34:01,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 80 SyntacticMatches, 37 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:34:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:34:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:34:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:34:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 15:34:02,000 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-12-03 15:34:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:02,000 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 15:34:02,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:34:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 15:34:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:34:02,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:02,001 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2018-12-03 15:34:02,001 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:02,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:02,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1012222246, now seen corresponding path program 36 times [2018-12-03 15:34:02,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:02,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:02,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:02,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:02,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:02,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:02,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:02,565 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:34:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:02,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:02,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:02,574 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:02,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:02,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:02,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:02,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:03,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:03,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 24 [2018-12-03 15:34:03,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:03,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:34:03,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:34:03,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:34:03,214 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 25 states. [2018-12-03 15:34:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:03,562 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-12-03 15:34:03,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:34:03,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-12-03 15:34:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:03,562 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:34:03,563 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:34:03,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:34:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:34:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-03 15:34:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:34:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 15:34:03,578 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-03 15:34:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:03,578 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 15:34:03,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:34:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 15:34:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:34:03,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:03,579 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2018-12-03 15:34:03,579 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:03,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2082902722, now seen corresponding path program 37 times [2018-12-03 15:34:03,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:03,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:03,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:04,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:04,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:04,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:04,210 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:34:04,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:04,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:04,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:04,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:04,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:04,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:04,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:04,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 15:34:04,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:04,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:34:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:34:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:34:04,776 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 42 states. [2018-12-03 15:34:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:05,951 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-12-03 15:34:05,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:34:05,951 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2018-12-03 15:34:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:05,952 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:34:05,952 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:34:05,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 84 SyntacticMatches, 39 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:34:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:34:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:34:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:34:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-03 15:34:05,964 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-03 15:34:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:05,964 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-03 15:34:05,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:34:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-03 15:34:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:34:05,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:05,965 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2018-12-03 15:34:05,965 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:05,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:05,965 INFO L82 PathProgramCache]: Analyzing trace with hash 346890169, now seen corresponding path program 38 times [2018-12-03 15:34:05,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:05,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:05,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:05,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:05,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:06,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:06,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:06,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:06,338 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:34:06,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:06,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:06,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:06,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:06,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:34:06,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:06,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:06,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:07,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:07,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 25 [2018-12-03 15:34:07,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:07,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:34:07,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:34:07,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:34:07,186 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 26 states. [2018-12-03 15:34:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:08,027 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-12-03 15:34:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:34:08,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-12-03 15:34:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:08,028 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:34:08,028 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:34:08,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 103 SyntacticMatches, 40 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=807, Invalid=1355, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:34:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:34:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-03 15:34:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:34:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-03 15:34:08,041 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2018-12-03 15:34:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:08,041 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-03 15:34:08,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:34:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-03 15:34:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:34:08,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:08,042 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2018-12-03 15:34:08,042 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:08,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1646063467, now seen corresponding path program 39 times [2018-12-03 15:34:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:08,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:08,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:08,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:08,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:08,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:08,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:08,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:08,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:08,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:08,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:08,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:08,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:08,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:08,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:09,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:09,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 15:34:09,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:09,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:34:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:34:09,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:34:09,447 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 44 states. [2018-12-03 15:34:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:10,079 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-12-03 15:34:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:34:10,079 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2018-12-03 15:34:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:10,079 INFO L225 Difference]: With dead ends: 112 [2018-12-03 15:34:10,079 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:34:10,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 88 SyntacticMatches, 41 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:34:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:34:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:34:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:34:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 15:34:10,092 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2018-12-03 15:34:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:10,092 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 15:34:10,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:34:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 15:34:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:34:10,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:10,092 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2018-12-03 15:34:10,093 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:10,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:10,093 INFO L82 PathProgramCache]: Analyzing trace with hash 800148542, now seen corresponding path program 40 times [2018-12-03 15:34:10,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:10,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:10,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:10,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:10,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:10,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:10,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:10,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:10,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:10,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:10,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:10,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:10,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:10,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:11,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:11,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 26 [2018-12-03 15:34:11,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:11,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:34:11,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:34:11,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:34:11,491 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 27 states. [2018-12-03 15:34:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:12,062 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-03 15:34:12,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:34:12,062 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-12-03 15:34:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:12,063 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:34:12,063 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:34:12,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 42 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:34:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:34:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-03 15:34:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:34:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 15:34:12,079 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 15:34:12,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:12,079 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 15:34:12,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:34:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 15:34:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:34:12,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:12,080 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2018-12-03 15:34:12,080 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:12,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash 143536090, now seen corresponding path program 41 times [2018-12-03 15:34:12,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:12,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:12,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:13,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:13,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:13,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:13,112 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:34:13,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:13,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:13,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:13,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:13,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:34:13,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:13,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:13,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:13,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:13,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 15:34:13,948 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:13,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:34:13,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:34:13,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:34:13,949 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 46 states. [2018-12-03 15:34:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:14,966 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 15:34:14,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:34:14,966 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 68 [2018-12-03 15:34:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:14,967 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:34:14,967 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:34:14,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 92 SyntacticMatches, 43 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:34:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:34:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:34:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:34:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-12-03 15:34:14,980 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-12-03 15:34:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:14,980 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-12-03 15:34:14,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:34:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-12-03 15:34:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:34:14,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:14,981 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2018-12-03 15:34:14,981 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:14,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1759582319, now seen corresponding path program 42 times [2018-12-03 15:34:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:14,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:14,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:15,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:15,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:15,391 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:15,392 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:34:15,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:15,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:15,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:15,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:15,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:15,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:15,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:15,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:15,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:15,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 27 [2018-12-03 15:34:15,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:15,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:34:15,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:34:15,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:34:15,897 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 28 states. [2018-12-03 15:34:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:16,394 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-12-03 15:34:16,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:34:16,394 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-12-03 15:34:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:16,395 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:34:16,395 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:34:16,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 113 SyntacticMatches, 44 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=952, Invalid=1598, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:34:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:34:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-12-03 15:34:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:34:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-03 15:34:16,411 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-12-03 15:34:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:16,411 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-03 15:34:16,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:34:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-03 15:34:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:34:16,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:16,412 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2018-12-03 15:34:16,412 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:16,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1258439277, now seen corresponding path program 43 times [2018-12-03 15:34:16,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:16,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:16,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:17,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:17,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:17,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:17,567 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:34:17,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:17,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:17,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:17,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:17,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:17,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:18,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:18,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 15:34:18,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:18,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:34:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:34:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:34:18,296 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 48 states. [2018-12-03 15:34:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:19,128 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-12-03 15:34:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:34:19,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2018-12-03 15:34:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:19,129 INFO L225 Difference]: With dead ends: 122 [2018-12-03 15:34:19,129 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:34:19,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 96 SyntacticMatches, 45 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:34:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:34:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:34:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:34:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 15:34:19,143 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-12-03 15:34:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:19,143 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 15:34:19,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:34:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 15:34:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:34:19,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:19,143 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2018-12-03 15:34:19,144 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:19,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash -973776042, now seen corresponding path program 44 times [2018-12-03 15:34:19,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:19,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:19,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:19,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:19,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:19,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:19,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:19,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:19,476 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:34:19,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:19,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:19,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:19,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:19,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 15:34:19,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:19,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:19,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:20,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:20,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 28 [2018-12-03 15:34:20,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:20,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:34:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:34:20,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:34:20,059 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 29 states. [2018-12-03 15:34:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:20,497 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-12-03 15:34:20,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:34:20,497 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2018-12-03 15:34:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:20,498 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:34:20,499 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:34:20,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 46 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1029, Invalid=1727, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:34:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:34:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-03 15:34:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:34:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 15:34:20,514 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 15:34:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:20,515 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 15:34:20,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:34:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 15:34:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:34:20,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:20,515 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2018-12-03 15:34:20,515 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:20,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:20,516 INFO L82 PathProgramCache]: Analyzing trace with hash 504027378, now seen corresponding path program 45 times [2018-12-03 15:34:20,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:20,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:20,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:20,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:21,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:21,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:21,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:21,283 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:34:21,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:21,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:21,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:21,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:21,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:21,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:21,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:21,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:22,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:22,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 15:34:22,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:22,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:34:22,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:34:22,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:34:22,637 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 50 states. [2018-12-03 15:34:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:23,871 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-12-03 15:34:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:34:23,871 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 74 [2018-12-03 15:34:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:23,872 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:34:23,872 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:34:23,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 100 SyntacticMatches, 47 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:34:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:34:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:34:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:34:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-03 15:34:23,892 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-03 15:34:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:23,892 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-03 15:34:23,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:34:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-03 15:34:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:34:23,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:23,893 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2018-12-03 15:34:23,893 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:23,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash -443896983, now seen corresponding path program 46 times [2018-12-03 15:34:23,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:23,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:23,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:24,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:24,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:24,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:24,673 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:34:24,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:24,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:24,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:24,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:24,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:25,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:25,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 29 [2018-12-03 15:34:25,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:25,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:34:25,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:34:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:34:25,394 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 30 states. [2018-12-03 15:34:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:25,857 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-12-03 15:34:25,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:34:25,857 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 75 [2018-12-03 15:34:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:25,858 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:34:25,858 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:34:25,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 123 SyntacticMatches, 48 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1109, Invalid=1861, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:34:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:34:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-03 15:34:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:34:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-03 15:34:25,879 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-12-03 15:34:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:25,879 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-03 15:34:25,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:34:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-03 15:34:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:34:25,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:25,879 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2018-12-03 15:34:25,880 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:25,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1383305147, now seen corresponding path program 47 times [2018-12-03 15:34:25,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:25,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:25,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:26,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:26,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:26,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:26,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:26,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:26,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:26,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:26,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:26,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:34:26,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:26,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:26,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:28,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:28,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 15:34:28,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:28,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:34:28,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:34:28,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:34:28,970 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 52 states. [2018-12-03 15:34:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:30,264 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 15:34:30,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:34:30,265 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 77 [2018-12-03 15:34:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:30,265 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:34:30,265 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:34:30,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 104 SyntacticMatches, 49 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:34:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:34:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 15:34:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:34:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 15:34:30,287 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2018-12-03 15:34:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:30,287 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 15:34:30,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:34:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 15:34:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:34:30,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:30,288 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2018-12-03 15:34:30,288 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:30,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1587972498, now seen corresponding path program 48 times [2018-12-03 15:34:30,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:30,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:30,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:30,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:31,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:31,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:31,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:31,210 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:34:31,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:31,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:31,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:31,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:31,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:31,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:31,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:31,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:31,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:31,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 30 [2018-12-03 15:34:31,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:31,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:34:31,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:34:31,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:34:31,948 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 31 states. [2018-12-03 15:34:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:32,897 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-03 15:34:32,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:34:32,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-12-03 15:34:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:32,898 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:34:32,898 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:34:32,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 128 SyntacticMatches, 50 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1192, Invalid=2000, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:34:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:34:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-12-03 15:34:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:34:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 15:34:32,916 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-03 15:34:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:32,917 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 15:34:32,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:34:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 15:34:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:34:32,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:32,917 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2018-12-03 15:34:32,918 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:32,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1328247286, now seen corresponding path program 49 times [2018-12-03 15:34:32,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:32,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:32,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:34,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:34,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:34,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:34,410 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:34:34,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:34,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:34,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:34,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:34,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:34,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:35,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:35,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 15:34:35,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:35,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:34:35,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:34:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:34:35,322 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 54 states. [2018-12-03 15:34:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:36,715 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 15:34:36,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:34:36,716 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 80 [2018-12-03 15:34:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:36,717 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:34:36,717 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:34:36,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 108 SyntacticMatches, 51 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2225 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:34:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:34:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:34:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:34:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-12-03 15:34:36,737 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-12-03 15:34:36,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:36,737 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-12-03 15:34:36,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:34:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-12-03 15:34:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:34:36,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:36,738 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2018-12-03 15:34:36,738 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:36,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash 280259393, now seen corresponding path program 50 times [2018-12-03 15:34:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:36,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:36,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:36,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:37,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:37,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:37,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:37,603 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:34:37,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:37,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:37,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:37,618 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:37,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:34:37,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:37,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:37,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:38,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:38,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 31 [2018-12-03 15:34:38,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:38,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:34:38,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:34:38,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:34:38,397 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 32 states. [2018-12-03 15:34:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:39,008 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-12-03 15:34:39,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:34:39,008 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-12-03 15:34:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:39,009 INFO L225 Difference]: With dead ends: 90 [2018-12-03 15:34:39,009 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:34:39,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 133 SyntacticMatches, 52 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1278, Invalid=2144, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:34:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:34:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-03 15:34:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:34:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-03 15:34:39,030 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2018-12-03 15:34:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:39,030 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-03 15:34:39,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:34:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-03 15:34:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:34:39,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:39,030 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2018-12-03 15:34:39,031 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:39,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:39,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1253729763, now seen corresponding path program 51 times [2018-12-03 15:34:39,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:39,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:39,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:40,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:40,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:40,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:40,154 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:34:40,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:40,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:40,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:40,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:40,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:40,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:40,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:40,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:41,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:41,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 15:34:41,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:41,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:34:41,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:34:41,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:34:41,185 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 56 states. [2018-12-03 15:34:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:43,075 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-12-03 15:34:43,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:34:43,076 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 83 [2018-12-03 15:34:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:43,076 INFO L225 Difference]: With dead ends: 142 [2018-12-03 15:34:43,076 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:34:43,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 112 SyntacticMatches, 53 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:34:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:34:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:34:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:34:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 15:34:43,094 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-12-03 15:34:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:43,094 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 15:34:43,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:34:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 15:34:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:34:43,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:43,095 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2018-12-03 15:34:43,095 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:43,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:43,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1181377146, now seen corresponding path program 52 times [2018-12-03 15:34:43,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:43,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:43,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:43,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:43,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:43,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:43,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:43,590 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:43,590 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:34:43,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:43,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:43,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:43,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:43,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:43,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:44,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:44,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 32 [2018-12-03 15:34:44,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:44,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:34:44,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:34:44,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:34:44,390 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 33 states. [2018-12-03 15:34:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:44,945 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-12-03 15:34:44,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:34:44,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2018-12-03 15:34:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:44,946 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:34:44,947 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:34:44,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 138 SyntacticMatches, 54 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1367, Invalid=2293, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:34:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:34:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-12-03 15:34:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:34:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 15:34:44,967 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-03 15:34:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:44,967 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 15:34:44,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:34:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 15:34:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:34:44,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:44,967 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2018-12-03 15:34:44,968 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:44,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:44,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1432137950, now seen corresponding path program 53 times [2018-12-03 15:34:44,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:44,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:44,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:44,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:44,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:46,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:46,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:46,257 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:46,257 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:34:46,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:46,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:46,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:46,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:46,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:34:46,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:46,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:46,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:47,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:47,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 15:34:47,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:47,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:34:47,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:34:47,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:34:47,371 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 58 states. [2018-12-03 15:34:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:49,211 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-12-03 15:34:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:34:49,211 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 86 [2018-12-03 15:34:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:49,213 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:34:49,213 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:34:49,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 116 SyntacticMatches, 55 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:34:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:34:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 15:34:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:34:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-03 15:34:49,232 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-03 15:34:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:49,232 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-03 15:34:49,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:34:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-03 15:34:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:34:49,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:49,233 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2018-12-03 15:34:49,233 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:49,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:49,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2048907495, now seen corresponding path program 54 times [2018-12-03 15:34:49,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:49,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:49,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:49,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:49,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:49,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:49,680 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:49,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:49,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:49,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:49,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:49,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:49,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:49,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:49,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:49,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:50,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:50,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 33 [2018-12-03 15:34:50,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:50,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:34:50,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:34:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:34:50,435 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 34 states. [2018-12-03 15:34:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:50,999 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-12-03 15:34:50,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:34:50,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 87 [2018-12-03 15:34:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:51,000 INFO L225 Difference]: With dead ends: 96 [2018-12-03 15:34:51,001 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:34:51,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 143 SyntacticMatches, 56 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1459, Invalid=2447, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:34:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:34:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-12-03 15:34:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:34:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-12-03 15:34:51,028 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2018-12-03 15:34:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:51,029 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-12-03 15:34:51,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:34:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-12-03 15:34:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:34:51,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:51,030 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2018-12-03 15:34:51,030 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:51,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1905147915, now seen corresponding path program 55 times [2018-12-03 15:34:51,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:51,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:51,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:52,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:52,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:52,056 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:52,057 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:34:52,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:52,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:52,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:52,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:52,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:52,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:53,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:53,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 15:34:53,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:53,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:34:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:34:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:34:53,429 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 60 states. [2018-12-03 15:34:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:55,200 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-12-03 15:34:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:34:55,200 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 89 [2018-12-03 15:34:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:55,201 INFO L225 Difference]: With dead ends: 152 [2018-12-03 15:34:55,201 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:34:55,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 120 SyntacticMatches, 57 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:34:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:34:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:34:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:34:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 15:34:55,230 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2018-12-03 15:34:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:55,230 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 15:34:55,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:34:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 15:34:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:34:55,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:55,231 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2018-12-03 15:34:55,231 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:55,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2078396574, now seen corresponding path program 56 times [2018-12-03 15:34:55,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:55,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:55,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:56,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:56,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:56,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:56,122 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:34:56,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:56,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:56,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:56,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:56,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 15:34:56,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:56,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:56,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:57,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:57,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 34 [2018-12-03 15:34:57,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:57,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:34:57,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:34:57,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:34:57,093 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 35 states. [2018-12-03 15:34:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:57,718 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-03 15:34:57,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:34:57,719 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-12-03 15:34:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:57,720 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:34:57,720 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:34:57,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 58 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1554, Invalid=2606, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:34:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:34:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-12-03 15:34:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:34:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 15:34:57,748 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 15:34:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:57,749 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 15:34:57,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:34:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 15:34:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 15:34:57,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:57,750 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2018-12-03 15:34:57,750 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:57,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash 179248186, now seen corresponding path program 57 times [2018-12-03 15:34:57,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:57,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:57,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:59,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:59,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:59,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:59,192 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:34:59,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:59,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:59,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:59,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:59,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:59,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:59,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:00,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:00,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 15:35:00,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:00,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:35:00,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:35:00,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:35:00,314 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 62 states. [2018-12-03 15:35:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:01,976 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-12-03 15:35:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:35:01,976 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 92 [2018-12-03 15:35:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:01,977 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:35:01,977 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:35:01,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 124 SyntacticMatches, 59 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:35:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:35:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 15:35:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:35:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-03 15:35:02,001 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-12-03 15:35:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:02,001 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-03 15:35:02,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:35:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-03 15:35:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 15:35:02,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:02,002 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2018-12-03 15:35:02,002 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:02,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:02,002 INFO L82 PathProgramCache]: Analyzing trace with hash -288235791, now seen corresponding path program 58 times [2018-12-03 15:35:02,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:02,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:02,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:02,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:02,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:02,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:02,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:02,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:02,501 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:35:02,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:02,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:02,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:02,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:02,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:02,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:03,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:03,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 35 [2018-12-03 15:35:03,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:03,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:35:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:35:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:35:03,698 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 36 states. [2018-12-03 15:35:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:04,347 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-12-03 15:35:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:35:04,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 93 [2018-12-03 15:35:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:04,348 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:35:04,349 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:35:04,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 153 SyntacticMatches, 60 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1652, Invalid=2770, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:35:04,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:35:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-12-03 15:35:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:35:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-03 15:35:04,372 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-12-03 15:35:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:04,372 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-03 15:35:04,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:35:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-03 15:35:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:35:04,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:04,373 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2018-12-03 15:35:04,373 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:04,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2116754995, now seen corresponding path program 59 times [2018-12-03 15:35:04,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:04,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:04,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:05,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:05,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:05,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:05,543 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:35:05,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:05,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:05,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:05,552 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:05,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 15:35:05,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:05,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:05,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:06,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:06,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 15:35:06,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:06,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:35:06,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:35:06,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:35:06,788 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 64 states. [2018-12-03 15:35:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:08,955 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-03 15:35:08,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:35:08,956 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 95 [2018-12-03 15:35:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:08,956 INFO L225 Difference]: With dead ends: 162 [2018-12-03 15:35:08,956 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:35:08,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 128 SyntacticMatches, 61 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:35:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:35:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 15:35:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 15:35:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 15:35:08,978 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-12-03 15:35:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:08,978 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 15:35:08,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:35:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 15:35:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:35:08,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:08,979 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2018-12-03 15:35:08,980 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:08,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash -352972874, now seen corresponding path program 60 times [2018-12-03 15:35:08,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:08,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:08,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:08,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:08,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:09,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:09,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:09,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:09,637 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:35:09,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:09,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:09,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:09,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:09,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:09,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:09,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:10,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:11,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:11,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 36 [2018-12-03 15:35:11,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:11,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:35:11,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:35:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:35:11,086 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 37 states. [2018-12-03 15:35:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:11,740 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-12-03 15:35:11,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:35:11,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-12-03 15:35:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:11,741 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:35:11,741 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:35:11,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 158 SyntacticMatches, 62 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1753, Invalid=2939, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:35:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:35:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-03 15:35:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 15:35:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 15:35:11,765 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 15:35:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:11,765 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 15:35:11,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:35:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 15:35:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:35:11,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:11,766 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2018-12-03 15:35:11,766 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:11,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash 95417682, now seen corresponding path program 61 times [2018-12-03 15:35:11,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:11,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:11,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:12,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:12,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:12,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:12,965 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:35:12,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:12,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:12,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:12,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:13,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:13,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:14,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:14,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 15:35:14,735 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:14,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:35:14,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:35:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:35:14,737 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 66 states. [2018-12-03 15:35:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:16,662 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-12-03 15:35:16,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:35:16,662 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 98 [2018-12-03 15:35:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:16,663 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:35:16,663 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:35:16,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 132 SyntacticMatches, 63 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3410 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:35:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:35:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:35:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:35:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-03 15:35:16,686 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-03 15:35:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:16,687 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-03 15:35:16,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:35:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-03 15:35:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:35:16,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:16,687 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2018-12-03 15:35:16,687 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:16,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 298685129, now seen corresponding path program 62 times [2018-12-03 15:35:16,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:16,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:16,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:16,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:17,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:17,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:17,234 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:17,234 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:35:17,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:17,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:17,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:17,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:17,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:35:17,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:17,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:17,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:18,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:18,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 37 [2018-12-03 15:35:18,346 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:18,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:35:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:35:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:35:18,347 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 38 states. [2018-12-03 15:35:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:19,251 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2018-12-03 15:35:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:35:19,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-12-03 15:35:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:19,253 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:35:19,253 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:35:19,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 163 SyntacticMatches, 64 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1857, Invalid=3113, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:35:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:35:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-12-03 15:35:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:35:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-12-03 15:35:19,280 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2018-12-03 15:35:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:19,280 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-12-03 15:35:19,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:35:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-12-03 15:35:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 15:35:19,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:19,281 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2018-12-03 15:35:19,282 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:19,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash -726466651, now seen corresponding path program 63 times [2018-12-03 15:35:19,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:19,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:19,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:19,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:20,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:20,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:20,668 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:20,668 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:35:20,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:20,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:20,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:20,679 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:20,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:20,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:20,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:20,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:21,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:21,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 15:35:21,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:21,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:35:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:35:21,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:35:21,985 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 68 states. [2018-12-03 15:35:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:24,357 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-12-03 15:35:24,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:35:24,357 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 101 [2018-12-03 15:35:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:24,357 INFO L225 Difference]: With dead ends: 172 [2018-12-03 15:35:24,357 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:35:24,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 136 SyntacticMatches, 65 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3632 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:35:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:35:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 15:35:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 15:35:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 15:35:24,385 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2018-12-03 15:35:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:24,385 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 15:35:24,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:35:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 15:35:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:35:24,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:24,386 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2018-12-03 15:35:24,386 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:24,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1089840434, now seen corresponding path program 64 times [2018-12-03 15:35:24,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:24,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:24,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:24,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:24,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:24,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:24,975 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:35:24,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:24,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:24,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:25,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:25,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:25,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:25,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 38 [2018-12-03 15:35:25,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:25,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:35:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:35:25,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:35:25,950 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2018-12-03 15:35:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:26,675 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-03 15:35:26,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:35:26,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-12-03 15:35:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:26,677 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:35:26,677 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:35:26,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 168 SyntacticMatches, 66 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1964, Invalid=3292, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:35:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:35:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-03 15:35:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:35:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 15:35:26,705 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-03 15:35:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:26,706 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 15:35:26,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:35:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 15:35:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:35:26,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:26,706 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2018-12-03 15:35:26,706 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:26,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:26,707 INFO L82 PathProgramCache]: Analyzing trace with hash 635296362, now seen corresponding path program 65 times [2018-12-03 15:35:26,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:26,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:26,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:26,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:26,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:28,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:28,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:28,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:28,083 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:35:28,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:28,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:28,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:28,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:28,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:35:28,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:28,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:28,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:29,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 15:35:29,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:29,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:35:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:35:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:35:29,747 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 70 states. [2018-12-03 15:35:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:32,056 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-12-03 15:35:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:35:32,056 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 104 [2018-12-03 15:35:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:32,057 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:35:32,057 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:35:32,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 140 SyntacticMatches, 67 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:35:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:35:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 15:35:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:35:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-12-03 15:35:32,084 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-12-03 15:35:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:32,084 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-12-03 15:35:32,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:35:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-12-03 15:35:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:35:32,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:32,085 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2018-12-03 15:35:32,085 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:32,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1315487071, now seen corresponding path program 66 times [2018-12-03 15:35:32,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:32,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:32,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:32,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:32,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:32,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:32,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:32,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:32,667 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:35:32,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:32,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:32,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:32,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:32,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:32,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:32,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:32,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:33,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:33,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 39 [2018-12-03 15:35:33,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:33,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:35:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:35:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:35:33,767 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 40 states. [2018-12-03 15:35:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:34,671 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-12-03 15:35:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:35:34,672 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 15:35:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:34,673 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:35:34,673 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:35:34,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 173 SyntacticMatches, 68 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2074, Invalid=3476, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:35:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:35:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-12-03 15:35:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:35:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-03 15:35:34,707 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2018-12-03 15:35:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:34,707 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-03 15:35:34,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:35:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-03 15:35:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:35:34,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:34,708 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2018-12-03 15:35:34,708 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:34,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1462756995, now seen corresponding path program 67 times [2018-12-03 15:35:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:34,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:34,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:36,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:36,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:36,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:36,147 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:35:36,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:36,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:36,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:36,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:36,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:36,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:37,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:37,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 15:35:37,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:37,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:35:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:35:37,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:35:37,631 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 72 states. [2018-12-03 15:35:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:40,354 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-12-03 15:35:40,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:35:40,354 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 107 [2018-12-03 15:35:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:40,354 INFO L225 Difference]: With dead ends: 182 [2018-12-03 15:35:40,355 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:35:40,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 144 SyntacticMatches, 69 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4097 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:35:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:35:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 15:35:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 15:35:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 15:35:40,383 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-12-03 15:35:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:40,383 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 15:35:40,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:35:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 15:35:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:35:40,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:40,384 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2018-12-03 15:35:40,384 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:40,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:40,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2049527322, now seen corresponding path program 68 times [2018-12-03 15:35:40,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:40,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:40,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:40,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:40,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:40,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:40,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:40,998 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:40,998 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:35:40,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:40,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:41,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:41,007 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:41,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 15:35:41,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:41,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:41,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:42,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:42,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 40 [2018-12-03 15:35:42,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:42,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:35:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:35:42,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:35:42,208 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 41 states. [2018-12-03 15:35:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:43,048 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-12-03 15:35:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:35:43,049 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 108 [2018-12-03 15:35:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:43,049 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:35:43,049 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:35:43,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 178 SyntacticMatches, 70 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2187, Invalid=3665, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:35:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:35:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-03 15:35:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:35:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 15:35:43,079 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-03 15:35:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:43,079 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 15:35:43,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:35:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 15:35:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:35:43,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:43,079 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2018-12-03 15:35:43,080 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:43,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1794165634, now seen corresponding path program 69 times [2018-12-03 15:35:43,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:43,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:43,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:44,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:44,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:44,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:44,901 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:35:44,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:44,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:44,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:44,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:44,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:44,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:44,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:45,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:46,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:46,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 15:35:46,417 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:46,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:35:46,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:35:46,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:35:46,418 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 74 states. [2018-12-03 15:35:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:49,010 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-12-03 15:35:49,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:35:49,010 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 110 [2018-12-03 15:35:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:49,011 INFO L225 Difference]: With dead ends: 187 [2018-12-03 15:35:49,011 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:35:49,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 148 SyntacticMatches, 71 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4340 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:35:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:35:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 15:35:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:35:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-03 15:35:49,040 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-03 15:35:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:49,040 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-03 15:35:49,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:35:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-03 15:35:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:35:49,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:49,041 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2018-12-03 15:35:49,041 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:49,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1836248697, now seen corresponding path program 70 times [2018-12-03 15:35:49,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:49,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:49,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:49,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:49,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:49,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:49,996 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:35:49,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:49,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:50,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:50,005 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:50,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:50,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:51,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:51,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 41 [2018-12-03 15:35:51,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:51,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:35:51,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:35:51,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:35:51,319 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 42 states. [2018-12-03 15:35:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:52,144 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-12-03 15:35:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:35:52,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 15:35:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:52,145 INFO L225 Difference]: With dead ends: 120 [2018-12-03 15:35:52,145 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:35:52,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 183 SyntacticMatches, 72 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2303, Invalid=3859, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:35:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:35:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-03 15:35:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:35:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-12-03 15:35:52,178 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2018-12-03 15:35:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:52,179 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-12-03 15:35:52,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:35:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-12-03 15:35:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:35:52,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:52,179 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2018-12-03 15:35:52,179 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:52,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash -596627627, now seen corresponding path program 71 times [2018-12-03 15:35:52,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:52,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:53,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:53,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:53,731 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:53,731 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:35:53,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:53,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:53,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:53,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:53,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 15:35:53,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:53,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:53,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:55,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:55,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 15:35:55,693 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:55,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:35:55,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:35:55,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:35:55,694 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 76 states. [2018-12-03 15:35:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:58,399 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-12-03 15:35:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:35:58,399 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 113 [2018-12-03 15:35:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:58,400 INFO L225 Difference]: With dead ends: 192 [2018-12-03 15:35:58,400 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:35:58,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 152 SyntacticMatches, 73 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4590 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:35:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:35:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 15:35:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:35:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 15:35:58,429 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2018-12-03 15:35:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:58,429 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 15:35:58,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:35:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 15:35:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:35:58,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:58,430 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2018-12-03 15:35:58,430 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:58,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1030548226, now seen corresponding path program 72 times [2018-12-03 15:35:58,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:58,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:58,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:59,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:59,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:59,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:59,158 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:35:59,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:59,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:59,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:59,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:59,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:59,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:59,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:00,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:00,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 42 [2018-12-03 15:36:00,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:00,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:36:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:36:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:36:00,584 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 43 states. [2018-12-03 15:36:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:01,414 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-12-03 15:36:01,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:36:01,414 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 114 [2018-12-03 15:36:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:01,416 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:36:01,416 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:36:01,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 188 SyntacticMatches, 74 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2422, Invalid=4058, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:36:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:36:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-12-03 15:36:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 15:36:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 15:36:01,449 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 15:36:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:01,449 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 15:36:01,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:36:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 15:36:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 15:36:01,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:01,450 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2018-12-03 15:36:01,450 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:01,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1780533402, now seen corresponding path program 73 times [2018-12-03 15:36:01,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:01,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:01,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:03,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:03,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:03,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:03,105 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:36:03,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:03,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:03,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:03,113 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:03,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:03,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:05,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:05,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 15:36:05,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:05,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:36:05,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:36:05,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:36:05,172 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 78 states. [2018-12-03 15:36:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:08,015 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 15:36:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:36:08,015 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 116 [2018-12-03 15:36:08,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:08,016 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:36:08,016 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:36:08,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 156 SyntacticMatches, 75 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4847 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:36:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:36:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 15:36:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:36:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-12-03 15:36:08,048 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-12-03 15:36:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:08,048 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-12-03 15:36:08,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:36:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-12-03 15:36:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 15:36:08,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:08,049 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2018-12-03 15:36:08,049 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:08,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1591437743, now seen corresponding path program 74 times [2018-12-03 15:36:08,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:08,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:08,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:08,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:08,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:08,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:08,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:08,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:08,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:08,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:08,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:09,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:36:09,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:09,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:09,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:10,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:10,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 43 [2018-12-03 15:36:10,571 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:10,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:36:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:36:10,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:36:10,572 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 44 states. [2018-12-03 15:36:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:11,479 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-12-03 15:36:11,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:36:11,480 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 117 [2018-12-03 15:36:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:11,481 INFO L225 Difference]: With dead ends: 126 [2018-12-03 15:36:11,481 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:36:11,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 193 SyntacticMatches, 76 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2544, Invalid=4262, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:36:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:36:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-12-03 15:36:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:36:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-12-03 15:36:11,520 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-12-03 15:36:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:11,520 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-12-03 15:36:11,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:36:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-12-03 15:36:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:36:11,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:11,521 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2018-12-03 15:36:11,521 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:11,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash -363380435, now seen corresponding path program 75 times [2018-12-03 15:36:11,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:11,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:11,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:13,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:13,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:13,273 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:13,273 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:36:13,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:13,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:13,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:13,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:13,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:13,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:13,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:13,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:15,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:15,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 15:36:15,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:15,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:36:15,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:36:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:36:15,320 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 80 states. [2018-12-03 15:36:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:18,140 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-12-03 15:36:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:36:18,140 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 119 [2018-12-03 15:36:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:18,140 INFO L225 Difference]: With dead ends: 202 [2018-12-03 15:36:18,141 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:36:18,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 160 SyntacticMatches, 77 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5111 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:36:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:36:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 15:36:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 15:36:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 15:36:18,172 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2018-12-03 15:36:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:18,172 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 15:36:18,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:36:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 15:36:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 15:36:18,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:18,173 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2018-12-03 15:36:18,173 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:18,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 234325014, now seen corresponding path program 76 times [2018-12-03 15:36:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:18,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:18,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:18,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:18,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:18,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:18,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:18,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:18,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:18,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:18,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:18,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:18,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:18,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:19,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:20,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:20,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 44 [2018-12-03 15:36:20,572 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:20,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:36:20,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:36:20,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:36:20,573 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 45 states. [2018-12-03 15:36:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:21,482 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-12-03 15:36:21,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:36:21,482 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 120 [2018-12-03 15:36:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:21,483 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:36:21,483 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:36:21,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 198 SyntacticMatches, 78 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2669, Invalid=4471, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:36:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:36:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-12-03 15:36:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 15:36:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 15:36:21,519 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 15:36:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:21,519 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 15:36:21,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:36:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 15:36:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:36:21,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:21,520 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2018-12-03 15:36:21,520 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:21,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:21,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1847972274, now seen corresponding path program 77 times [2018-12-03 15:36:21,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:21,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:21,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:21,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:21,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:23,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:23,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:23,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:23,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:36:23,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:23,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:23,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:23,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:23,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 15:36:23,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:23,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:23,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:25,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:25,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 81 [2018-12-03 15:36:25,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:25,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:36:25,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:36:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:36:25,646 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 82 states. [2018-12-03 15:36:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:28,981 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-12-03 15:36:28,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:36:28,981 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 122 [2018-12-03 15:36:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:28,982 INFO L225 Difference]: With dead ends: 207 [2018-12-03 15:36:28,982 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:36:28,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 164 SyntacticMatches, 79 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5382 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:36:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:36:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:36:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:36:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-12-03 15:36:29,018 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-12-03 15:36:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:29,018 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-12-03 15:36:29,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:36:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-12-03 15:36:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:36:29,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:29,019 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2018-12-03 15:36:29,019 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:29,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1156594217, now seen corresponding path program 78 times [2018-12-03 15:36:29,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:29,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:29,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:29,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:29,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:29,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:29,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:29,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:29,839 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:36:29,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:29,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:29,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:29,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:29,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:29,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:29,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:29,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:31,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:31,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 45 [2018-12-03 15:36:31,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:31,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:36:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:36:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:36:31,492 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 46 states. [2018-12-03 15:36:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:32,480 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-12-03 15:36:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:36:32,480 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 123 [2018-12-03 15:36:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:32,481 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:36:32,482 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:36:32,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 203 SyntacticMatches, 80 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2797, Invalid=4685, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:36:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:36:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-03 15:36:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 15:36:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-12-03 15:36:32,531 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2018-12-03 15:36:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:32,531 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-12-03 15:36:32,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:36:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-12-03 15:36:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 15:36:32,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:32,532 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2018-12-03 15:36:32,532 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:32,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash -909553915, now seen corresponding path program 79 times [2018-12-03 15:36:32,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:32,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:32,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:32,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:32,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:34,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:34,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:34,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:34,996 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:36:34,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:34,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:35,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:35,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:35,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:35,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:37,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:37,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 83 [2018-12-03 15:36:37,346 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:37,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:36:37,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:36:37,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:36:37,347 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 84 states. [2018-12-03 15:36:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:40,710 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 15:36:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:36:40,710 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 125 [2018-12-03 15:36:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:40,710 INFO L225 Difference]: With dead ends: 212 [2018-12-03 15:36:40,711 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:36:40,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 168 SyntacticMatches, 81 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5660 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:36:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:36:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 15:36:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 15:36:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 15:36:40,753 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2018-12-03 15:36:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:40,753 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 15:36:40,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:36:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 15:36:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 15:36:40,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:40,754 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2018-12-03 15:36:40,754 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:40,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash 909901614, now seen corresponding path program 80 times [2018-12-03 15:36:40,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:40,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:40,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:40,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:40,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:41,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:41,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:41,692 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:41,692 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:36:41,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:41,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:41,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:41,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:41,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 15:36:41,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:41,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:41,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:43,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:43,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 46 [2018-12-03 15:36:43,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:43,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:36:43,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:36:43,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:36:43,248 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 47 states. [2018-12-03 15:36:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:44,244 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-12-03 15:36:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:36:44,244 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 126 [2018-12-03 15:36:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:44,245 INFO L225 Difference]: With dead ends: 135 [2018-12-03 15:36:44,246 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:36:44,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 208 SyntacticMatches, 82 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2928, Invalid=4904, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:36:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:36:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-12-03 15:36:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 15:36:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 15:36:44,294 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-03 15:36:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:44,294 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 15:36:44,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:36:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 15:36:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:36:44,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:44,296 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2018-12-03 15:36:44,296 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:44,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1757944118, now seen corresponding path program 81 times [2018-12-03 15:36:44,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:44,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:44,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:46,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:46,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:46,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:46,570 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:36:46,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:46,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:36:46,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:36:46,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:36:46,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:46,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:46,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:48,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:48,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 85 [2018-12-03 15:36:48,726 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:48,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:36:48,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:36:48,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:36:48,727 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 86 states. [2018-12-03 15:36:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:52,556 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-12-03 15:36:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:36:52,556 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 128 [2018-12-03 15:36:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:52,557 INFO L225 Difference]: With dead ends: 217 [2018-12-03 15:36:52,557 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:36:52,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 172 SyntacticMatches, 83 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5945 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:36:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:36:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 15:36:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:36:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-12-03 15:36:52,609 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-12-03 15:36:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:52,609 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-12-03 15:36:52,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:36:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-12-03 15:36:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:36:52,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:52,610 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2018-12-03 15:36:52,610 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:52,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash -845555199, now seen corresponding path program 82 times [2018-12-03 15:36:52,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:52,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:52,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:36:52,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:52,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:53,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:53,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:53,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:53,450 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:36:53,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:53,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:53,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:53,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:36:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:53,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:53,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:36:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:54,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:36:54,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 47 [2018-12-03 15:36:54,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:36:54,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:36:54,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:36:54,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:36:54,995 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 48 states. [2018-12-03 15:36:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:36:56,354 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-12-03 15:36:56,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:36:56,355 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-12-03 15:36:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:36:56,356 INFO L225 Difference]: With dead ends: 138 [2018-12-03 15:36:56,356 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:36:56,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 213 SyntacticMatches, 84 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3062, Invalid=5128, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:36:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:36:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2018-12-03 15:36:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:36:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-12-03 15:36:56,395 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2018-12-03 15:36:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:36:56,396 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-12-03 15:36:56,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:36:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-12-03 15:36:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 15:36:56,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:36:56,397 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2018-12-03 15:36:56,397 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:36:56,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:36:56,397 INFO L82 PathProgramCache]: Analyzing trace with hash -829794083, now seen corresponding path program 83 times [2018-12-03 15:36:56,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:36:56,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:56,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:36:56,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:36:56,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:36:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:36:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:58,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:58,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:36:58,629 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:36:58,629 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:36:58,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:36:58,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:36:58,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:36:58,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:36:58,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 15:36:58,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:36:58,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:36:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:36:58,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:01,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:01,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 87 [2018-12-03 15:37:01,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:01,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:37:01,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:37:01,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:37:01,056 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 88 states. [2018-12-03 15:37:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:03,781 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-12-03 15:37:03,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:37:03,782 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 131 [2018-12-03 15:37:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:03,782 INFO L225 Difference]: With dead ends: 222 [2018-12-03 15:37:03,782 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:37:03,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 176 SyntacticMatches, 85 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6237 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 15:37:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:37:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 15:37:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 15:37:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 15:37:03,822 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2018-12-03 15:37:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:03,822 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 15:37:03,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:37:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 15:37:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 15:37:03,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:03,823 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2018-12-03 15:37:03,824 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:03,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:03,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1595442758, now seen corresponding path program 84 times [2018-12-03 15:37:03,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:03,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:03,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:04,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:04,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:04,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:04,714 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:37:04,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:04,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:04,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:37:04,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:37:04,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:37:04,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:04,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:04,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:06,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:06,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 48 [2018-12-03 15:37:06,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:06,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:37:06,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:37:06,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:37:06,647 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 49 states. [2018-12-03 15:37:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:07,778 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-12-03 15:37:07,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:37:07,779 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 132 [2018-12-03 15:37:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:07,780 INFO L225 Difference]: With dead ends: 141 [2018-12-03 15:37:07,780 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:37:07,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 218 SyntacticMatches, 86 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3199, Invalid=5357, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 15:37:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:37:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-03 15:37:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 15:37:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 15:37:07,823 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-03 15:37:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:07,823 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 15:37:07,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:37:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 15:37:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 15:37:07,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:07,824 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2018-12-03 15:37:07,824 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:07,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash -82901022, now seen corresponding path program 85 times [2018-12-03 15:37:07,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:07,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:07,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:07,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:07,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:09,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:09,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:09,973 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:09,973 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:37:09,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:09,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:09,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:09,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:10,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:10,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:12,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:12,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 89 [2018-12-03 15:37:12,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:12,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:37:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:37:12,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:37:12,531 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 90 states. [2018-12-03 15:37:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:15,344 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-12-03 15:37:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:37:15,344 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 134 [2018-12-03 15:37:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:15,345 INFO L225 Difference]: With dead ends: 227 [2018-12-03 15:37:15,345 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:37:15,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 180 SyntacticMatches, 87 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6536 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:37:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:37:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 15:37:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:37:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-12-03 15:37:15,386 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-12-03 15:37:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:15,386 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-12-03 15:37:15,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:37:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-12-03 15:37:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:37:15,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:15,387 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2018-12-03 15:37:15,387 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:15,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:15,387 INFO L82 PathProgramCache]: Analyzing trace with hash 207975897, now seen corresponding path program 86 times [2018-12-03 15:37:15,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:15,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:16,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:16,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:16,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:16,678 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:37:16,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:16,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:16,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:16,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:37:16,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 15:37:16,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:16,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:16,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:18,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:18,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 49 [2018-12-03 15:37:18,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:18,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:37:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:37:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:37:18,436 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 50 states. [2018-12-03 15:37:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:19,547 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-12-03 15:37:19,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:37:19,548 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 135 [2018-12-03 15:37:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:19,549 INFO L225 Difference]: With dead ends: 144 [2018-12-03 15:37:19,549 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 15:37:19,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 223 SyntacticMatches, 88 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3339, Invalid=5591, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:37:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 15:37:19,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-12-03 15:37:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 15:37:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-12-03 15:37:19,593 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2018-12-03 15:37:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:19,593 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-12-03 15:37:19,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:37:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-12-03 15:37:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 15:37:19,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:19,594 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2018-12-03 15:37:19,594 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:19,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1998692683, now seen corresponding path program 87 times [2018-12-03 15:37:19,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:19,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:19,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:22,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:22,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:22,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:22,400 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:37:22,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:22,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:22,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:37:22,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:37:22,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:37:22,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:22,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:22,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:24,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:24,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 91 [2018-12-03 15:37:24,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:24,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:37:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:37:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:37:24,737 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 92 states. [2018-12-03 15:37:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:27,899 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2018-12-03 15:37:27,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 15:37:27,899 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 137 [2018-12-03 15:37:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:27,900 INFO L225 Difference]: With dead ends: 232 [2018-12-03 15:37:27,900 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:37:27,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 184 SyntacticMatches, 89 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6842 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:37:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:37:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 15:37:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 15:37:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 15:37:27,943 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2018-12-03 15:37:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:27,943 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 15:37:27,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:37:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 15:37:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 15:37:27,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:27,944 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2018-12-03 15:37:27,944 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:27,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash 566565214, now seen corresponding path program 88 times [2018-12-03 15:37:27,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:27,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:27,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:28,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:28,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:28,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:28,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:28,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:28,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:28,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:28,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:29,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:29,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:30,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:30,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 50 [2018-12-03 15:37:30,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:30,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:37:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:37:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:37:30,646 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 51 states. [2018-12-03 15:37:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:32,064 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-12-03 15:37:32,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:37:32,064 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 138 [2018-12-03 15:37:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:32,066 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:37:32,066 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 15:37:32,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 228 SyntacticMatches, 90 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3482, Invalid=5830, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:37:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 15:37:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-03 15:37:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 15:37:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 15:37:32,113 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 15:37:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:32,113 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 15:37:32,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:37:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 15:37:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 15:37:32,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:32,114 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2018-12-03 15:37:32,114 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:32,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash -991742726, now seen corresponding path program 89 times [2018-12-03 15:37:32,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:32,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:32,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:32,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:34,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:34,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:34,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:34,525 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:37:34,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:34,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:34,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:34,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:37:34,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 15:37:34,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:34,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:34,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:37,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:37,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 93 [2018-12-03 15:37:37,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:37,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:37:37,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:37:37,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:37:37,338 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 94 states. [2018-12-03 15:37:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:40,368 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-12-03 15:37:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:37:40,368 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 140 [2018-12-03 15:37:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:40,369 INFO L225 Difference]: With dead ends: 237 [2018-12-03 15:37:40,369 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 15:37:40,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 188 SyntacticMatches, 91 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7155 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:37:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 15:37:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 15:37:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 15:37:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-12-03 15:37:40,414 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-12-03 15:37:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:40,414 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-12-03 15:37:40,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:37:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-12-03 15:37:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 15:37:40,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:40,415 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2018-12-03 15:37:40,415 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:40,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash 253169073, now seen corresponding path program 90 times [2018-12-03 15:37:40,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:40,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:40,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:40,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:40,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:41,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:41,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:41,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:41,432 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:37:41,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:41,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:41,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:37:41,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:37:41,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:37:41,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:41,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:41,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:43,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:43,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 51 [2018-12-03 15:37:43,504 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:43,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:37:43,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:37:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:37:43,505 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 52 states. [2018-12-03 15:37:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:44,692 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2018-12-03 15:37:44,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:37:44,692 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 141 [2018-12-03 15:37:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:44,693 INFO L225 Difference]: With dead ends: 150 [2018-12-03 15:37:44,693 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:37:44,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 233 SyntacticMatches, 92 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3628, Invalid=6074, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:37:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:37:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-12-03 15:37:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 15:37:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-12-03 15:37:44,740 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-12-03 15:37:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:44,740 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-12-03 15:37:44,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:37:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-12-03 15:37:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 15:37:44,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:44,741 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2018-12-03 15:37:44,741 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:44,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1517723507, now seen corresponding path program 91 times [2018-12-03 15:37:44,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:44,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:44,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:44,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:44,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:47,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:47,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:47,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:47,509 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:37:47,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:47,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:47,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:47,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:47,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:47,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:50,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:50,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 95 [2018-12-03 15:37:50,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:50,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:37:50,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:37:50,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:37:50,051 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 96 states. [2018-12-03 15:37:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:53,488 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-12-03 15:37:53,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:37:53,488 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 143 [2018-12-03 15:37:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:53,489 INFO L225 Difference]: With dead ends: 242 [2018-12-03 15:37:53,489 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 15:37:53,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 192 SyntacticMatches, 93 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7475 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:37:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 15:37:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 15:37:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 15:37:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 15:37:53,535 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2018-12-03 15:37:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:53,535 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 15:37:53,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:37:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 15:37:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 15:37:53,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:53,536 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2018-12-03 15:37:53,536 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:53,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1392920458, now seen corresponding path program 92 times [2018-12-03 15:37:53,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:53,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:53,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:54,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:54,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:54,536 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:54,537 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:37:54,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:54,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:54,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:54,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:37:54,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 15:37:54,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:54,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:54,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:56,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:56,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 52 [2018-12-03 15:37:56,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:56,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:37:56,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:37:56,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:37:56,507 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 53 states. [2018-12-03 15:37:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:57,983 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-12-03 15:37:57,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:37:57,983 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 144 [2018-12-03 15:37:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:57,985 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:37:57,985 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:37:57,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 238 SyntacticMatches, 94 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3777, Invalid=6323, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:37:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:37:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-12-03 15:37:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:37:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 15:37:58,034 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 15:37:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:58,034 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 15:37:58,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:37:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 15:37:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:37:58,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:58,035 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2018-12-03 15:37:58,035 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:58,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:58,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1433169426, now seen corresponding path program 93 times [2018-12-03 15:37:58,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:58,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:58,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:58,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:58,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:00,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:00,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:00,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:00,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:38:00,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:00,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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:00,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:00,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:00,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:00,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:00,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:00,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:03,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:03,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 97 [2018-12-03 15:38:03,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:03,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 15:38:03,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 15:38:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:38:03,702 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 98 states. [2018-12-03 15:38:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:06,694 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-12-03 15:38:06,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 15:38:06,694 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 146 [2018-12-03 15:38:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:06,695 INFO L225 Difference]: With dead ends: 247 [2018-12-03 15:38:06,695 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:38:06,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 196 SyntacticMatches, 95 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7802 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:38:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:38:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 15:38:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 15:38:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-12-03 15:38:06,758 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-12-03 15:38:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:06,758 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-12-03 15:38:06,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 15:38:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-12-03 15:38:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 15:38:06,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:06,759 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2018-12-03 15:38:06,759 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:06,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:06,760 INFO L82 PathProgramCache]: Analyzing trace with hash -876151, now seen corresponding path program 94 times [2018-12-03 15:38:06,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:06,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:06,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:06,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:06,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:08,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:08,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:08,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:08,110 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:38:08,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:08,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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:08,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:08,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:08,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:08,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:10,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:10,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 53 [2018-12-03 15:38:10,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:10,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:38:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:38:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:38:10,018 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 54 states. [2018-12-03 15:38:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:11,283 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-12-03 15:38:11,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:38:11,283 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 147 [2018-12-03 15:38:11,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:11,284 INFO L225 Difference]: With dead ends: 156 [2018-12-03 15:38:11,284 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:38:11,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 243 SyntacticMatches, 96 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3929, Invalid=6577, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:38:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:38:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-12-03 15:38:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 15:38:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-12-03 15:38:11,335 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2018-12-03 15:38:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:11,336 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-12-03 15:38:11,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:38:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-12-03 15:38:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 15:38:11,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:11,336 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2018-12-03 15:38:11,336 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:11,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash -842047899, now seen corresponding path program 95 times [2018-12-03 15:38:11,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:11,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:11,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:14,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:14,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:14,272 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:14,272 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:38:14,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:14,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:14,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:14,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:14,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:38:14,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:14,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:14,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:17,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:17,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 99 [2018-12-03 15:38:17,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:17,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 15:38:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 15:38:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:38:17,123 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 100 states. [2018-12-03 15:38:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:20,830 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-12-03 15:38:20,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 15:38:20,830 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 149 [2018-12-03 15:38:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:20,830 INFO L225 Difference]: With dead ends: 252 [2018-12-03 15:38:20,831 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:38:20,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 200 SyntacticMatches, 97 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8136 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 15:38:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:38:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 15:38:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 15:38:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 15:38:20,889 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2018-12-03 15:38:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:20,890 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 15:38:20,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 15:38:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 15:38:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 15:38:20,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:20,891 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2018-12-03 15:38:20,891 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:20,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash -454138994, now seen corresponding path program 96 times [2018-12-03 15:38:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:20,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:20,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:20,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:20,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:22,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:22,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:22,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:22,027 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:38:22,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:22,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:22,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:22,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:22,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:22,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:22,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:22,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:24,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:24,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 54 [2018-12-03 15:38:24,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:24,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:38:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:38:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:38:24,264 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 55 states. [2018-12-03 15:38:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:25,568 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-12-03 15:38:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:38:25,568 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 150 [2018-12-03 15:38:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:25,569 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:38:25,569 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:38:25,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 248 SyntacticMatches, 98 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4084, Invalid=6836, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 15:38:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:38:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-12-03 15:38:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 15:38:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 15:38:25,621 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-03 15:38:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:25,621 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 15:38:25,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:38:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 15:38:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 15:38:25,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:25,622 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2018-12-03 15:38:25,622 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:25,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1659024170, now seen corresponding path program 97 times [2018-12-03 15:38:25,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:25,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:25,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:28,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:28,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:28,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:28,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:28,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:28,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:28,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:28,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:28,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:28,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:31,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:31,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 101 [2018-12-03 15:38:31,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:31,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:38:31,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:38:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:38:31,571 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 102 states. [2018-12-03 15:38:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:34,919 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-12-03 15:38:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:38:34,919 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 152 [2018-12-03 15:38:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:34,920 INFO L225 Difference]: With dead ends: 257 [2018-12-03 15:38:34,920 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:38:34,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 204 SyntacticMatches, 99 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8477 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:38:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:38:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 15:38:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 15:38:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-12-03 15:38:34,969 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-12-03 15:38:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:34,970 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-12-03 15:38:34,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:38:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-12-03 15:38:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 15:38:34,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:34,970 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2018-12-03 15:38:34,971 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:34,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash 96219489, now seen corresponding path program 98 times [2018-12-03 15:38:34,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:34,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:34,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:36,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:36,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:36,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:36,098 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:38:36,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:36,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:36,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:36,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:36,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 15:38:36,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:36,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:36,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:38,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:38,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 55 [2018-12-03 15:38:38,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:38,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:38:38,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:38:38,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=1644, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:38:38,520 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 56 states. [2018-12-03 15:38:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:39,883 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-12-03 15:38:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 15:38:39,884 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 153 [2018-12-03 15:38:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:39,885 INFO L225 Difference]: With dead ends: 162 [2018-12-03 15:38:39,885 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:38:39,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 253 SyntacticMatches, 100 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5252 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4242, Invalid=7100, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:38:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:38:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-12-03 15:38:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 15:38:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-12-03 15:38:39,939 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2018-12-03 15:38:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:39,939 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-12-03 15:38:39,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:38:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-12-03 15:38:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 15:38:39,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:39,940 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2018-12-03 15:38:39,940 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:39,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:39,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2022418371, now seen corresponding path program 99 times [2018-12-03 15:38:39,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:39,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:39,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:39,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:39,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:42,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:42,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:42,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:42,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:42,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:42,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:42,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:38:42,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:38:43,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:38:43,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:43,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:43,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:46,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:46,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 103 [2018-12-03 15:38:46,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:46,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 15:38:46,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 15:38:46,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:38:46,122 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 104 states. [2018-12-03 15:38:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:50,078 INFO L93 Difference]: Finished difference Result 262 states and 264 transitions. [2018-12-03 15:38:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 15:38:50,078 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 155 [2018-12-03 15:38:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:50,079 INFO L225 Difference]: With dead ends: 262 [2018-12-03 15:38:50,079 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:38:50,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 208 SyntacticMatches, 101 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8825 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 15:38:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:38:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 15:38:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 15:38:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 15:38:50,134 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2018-12-03 15:38:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:50,134 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 15:38:50,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 15:38:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 15:38:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 15:38:50,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:50,135 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2018-12-03 15:38:50,135 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:50,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:50,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2091181402, now seen corresponding path program 100 times [2018-12-03 15:38:50,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:50,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:50,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:51,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:51,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:51,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:51,336 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:38:51,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:51,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:51,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:51,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:51,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:53,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:53,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2018-12-03 15:38:53,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:53,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:38:53,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:38:53,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:38:53,442 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 57 states. [2018-12-03 15:38:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:55,023 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-12-03 15:38:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 15:38:55,024 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 156 [2018-12-03 15:38:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:55,025 INFO L225 Difference]: With dead ends: 165 [2018-12-03 15:38:55,025 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:38:55,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 258 SyntacticMatches, 102 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4403, Invalid=7369, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 15:38:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:38:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-12-03 15:38:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 15:38:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 15:38:55,086 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-03 15:38:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:55,086 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 15:38:55,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:38:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 15:38:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 15:38:55,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:55,087 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2018-12-03 15:38:55,087 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:55,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:55,087 INFO L82 PathProgramCache]: Analyzing trace with hash 419300418, now seen corresponding path program 101 times [2018-12-03 15:38:55,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:55,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:55,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:55,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:55,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:58,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:58,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:58,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:38:58,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:38:58,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:58,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:38:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:38:58,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:58,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 15:38:58,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:58,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:58,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:01,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:01,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 105 [2018-12-03 15:39:01,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:01,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 15:39:01,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 15:39:01,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:39:01,673 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 106 states. [2018-12-03 15:39:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:05,849 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-12-03 15:39:05,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 15:39:05,850 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 158 [2018-12-03 15:39:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:05,851 INFO L225 Difference]: With dead ends: 267 [2018-12-03 15:39:05,851 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:39:05,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 212 SyntacticMatches, 103 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:39:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:39:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 15:39:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 15:39:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-12-03 15:39:05,908 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-12-03 15:39:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:05,908 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-12-03 15:39:05,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 15:39:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-12-03 15:39:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 15:39:05,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:05,909 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2018-12-03 15:39:05,909 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:05,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash 599244089, now seen corresponding path program 102 times [2018-12-03 15:39:05,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:05,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:05,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:07,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:07,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:07,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:07,203 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:39:07,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:07,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:07,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:39:07,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:39:07,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:39:07,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:07,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:07,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:09,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:09,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 57 [2018-12-03 15:39:09,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:09,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:39:09,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:39:09,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1545, Invalid=1761, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:39:09,764 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 58 states. [2018-12-03 15:39:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:11,274 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2018-12-03 15:39:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 15:39:11,274 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 159 [2018-12-03 15:39:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:11,275 INFO L225 Difference]: With dead ends: 168 [2018-12-03 15:39:11,275 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:39:11,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 263 SyntacticMatches, 104 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4567, Invalid=7643, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 15:39:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:39:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-12-03 15:39:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 15:39:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-12-03 15:39:11,345 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2018-12-03 15:39:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:11,345 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-12-03 15:39:11,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:39:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-12-03 15:39:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 15:39:11,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:11,346 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1] [2018-12-03 15:39:11,347 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:11,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash 347885077, now seen corresponding path program 103 times [2018-12-03 15:39:11,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:11,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:11,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:15,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:15,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:15,006 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:15,006 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:39:15,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:15,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:15,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:15,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:15,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:15,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:18,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:18,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 107 [2018-12-03 15:39:18,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:18,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 15:39:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 15:39:18,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:39:18,265 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 108 states. [2018-12-03 15:39:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:22,568 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-12-03 15:39:22,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 15:39:22,568 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 161 [2018-12-03 15:39:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:22,568 INFO L225 Difference]: With dead ends: 272 [2018-12-03 15:39:22,568 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:39:22,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 216 SyntacticMatches, 105 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9542 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 15:39:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:39:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 15:39:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 15:39:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 15:39:22,628 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2018-12-03 15:39:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:22,628 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 15:39:22,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 15:39:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 15:39:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:39:22,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:22,629 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2018-12-03 15:39:22,629 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:22,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash 930602430, now seen corresponding path program 104 times [2018-12-03 15:39:22,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:22,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:22,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:22,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:22,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:23,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:23,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:23,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:23,932 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:39:23,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:23,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:23,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:39:23,957 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:39:24,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 15:39:24,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:24,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:24,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:26,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:26,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 58 [2018-12-03 15:39:26,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:26,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:39:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:39:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:39:26,578 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 59 states. [2018-12-03 15:39:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:28,064 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-12-03 15:39:28,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 15:39:28,064 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 162 [2018-12-03 15:39:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:28,065 INFO L225 Difference]: With dead ends: 171 [2018-12-03 15:39:28,065 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 15:39:28,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 268 SyntacticMatches, 106 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4734, Invalid=7922, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:39:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 15:39:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-12-03 15:39:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:39:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 15:39:28,126 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 15:39:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:28,127 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 15:39:28,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:39:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 15:39:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 15:39:28,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:28,127 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1] [2018-12-03 15:39:28,128 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:28,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash 955670874, now seen corresponding path program 105 times [2018-12-03 15:39:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:28,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:28,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:28,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:32,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:32,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:32,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:32,371 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:39:32,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:32,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:39:32,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:39:32,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:39:32,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:32,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:32,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:36,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:36,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 109 [2018-12-03 15:39:36,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:36,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 15:39:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 15:39:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:39:36,120 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 110 states. [2018-12-03 15:39:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:40,523 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-12-03 15:39:40,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 15:39:40,523 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 164 [2018-12-03 15:39:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:40,523 INFO L225 Difference]: With dead ends: 277 [2018-12-03 15:39:40,523 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:39:40,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 220 SyntacticMatches, 107 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9911 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:39:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:39:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 15:39:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 15:39:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-12-03 15:39:40,589 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2018-12-03 15:39:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:40,590 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-12-03 15:39:40,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 15:39:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-12-03 15:39:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 15:39:40,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:40,590 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2018-12-03 15:39:40,591 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:40,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:40,591 INFO L82 PathProgramCache]: Analyzing trace with hash 430523665, now seen corresponding path program 106 times [2018-12-03 15:39:40,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:40,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:40,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:40,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:41,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:41,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:41,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:41,902 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:39:41,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:41,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:41,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:41,911 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:42,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:42,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:44,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:44,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 59 [2018-12-03 15:39:44,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:44,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:39:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:39:44,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1658, Invalid=1882, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:39:44,308 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 60 states. [2018-12-03 15:39:46,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:46,099 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-12-03 15:39:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 15:39:46,099 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 165 [2018-12-03 15:39:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:46,100 INFO L225 Difference]: With dead ends: 174 [2018-12-03 15:39:46,100 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 15:39:46,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 273 SyntacticMatches, 108 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6104 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4904, Invalid=8206, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:39:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 15:39:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-12-03 15:39:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 15:39:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-12-03 15:39:46,165 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2018-12-03 15:39:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:46,165 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-12-03 15:39:46,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:39:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-12-03 15:39:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 15:39:46,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:46,166 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1] [2018-12-03 15:39:46,166 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:46,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1416314861, now seen corresponding path program 107 times [2018-12-03 15:39:46,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:46,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:46,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:46,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:46,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:49,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:49,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:49,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:49,545 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:39:49,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:49,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:49,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:39:49,553 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:39:49,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 15:39:49,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:49,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:49,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:53,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:53,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 111 [2018-12-03 15:39:53,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:53,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 15:39:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 15:39:53,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:39:53,348 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 112 states. [2018-12-03 15:39:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:57,878 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-12-03 15:39:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 15:39:57,879 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 167 [2018-12-03 15:39:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:57,879 INFO L225 Difference]: With dead ends: 282 [2018-12-03 15:39:57,879 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 15:39:57,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 224 SyntacticMatches, 109 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10287 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=6381, Invalid=21341, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:39:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 15:39:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 15:39:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 15:39:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 15:39:57,948 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 167 [2018-12-03 15:39:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:57,948 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 15:39:57,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 15:39:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 15:39:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 15:39:57,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:57,949 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1, 1, 1] [2018-12-03 15:39:57,949 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:57,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash -973296426, now seen corresponding path program 108 times [2018-12-03 15:39:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:57,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:57,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:59,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:59,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:59,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:59,399 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:39:59,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:59,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:59,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:39:59,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:39:59,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:39:59,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:59,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:59,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:02,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:02,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 60 [2018-12-03 15:40:02,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:02,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:40:02,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:40:02,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:40:02,184 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 61 states. [2018-12-03 15:40:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:03,776 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-12-03 15:40:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 15:40:03,776 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 168 [2018-12-03 15:40:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:03,777 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:40:03,777 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:40:03,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 278 SyntacticMatches, 110 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6327 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5077, Invalid=8495, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 15:40:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:40:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-12-03 15:40:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 15:40:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 15:40:03,858 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 15:40:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:03,859 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 15:40:03,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:40:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 15:40:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:40:03,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:03,859 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1] [2018-12-03 15:40:03,859 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:03,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:03,860 INFO L82 PathProgramCache]: Analyzing trace with hash 964938354, now seen corresponding path program 109 times [2018-12-03 15:40:03,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:03,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:03,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:03,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:03,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:07,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:07,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:07,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:07,649 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:40:07,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:07,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:07,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:07,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:07,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:07,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:11,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:11,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 113 [2018-12-03 15:40:11,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:11,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 15:40:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 15:40:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:40:11,528 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 114 states. [2018-12-03 15:40:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:16,230 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-12-03 15:40:16,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 15:40:16,230 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 170 [2018-12-03 15:40:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:16,231 INFO L225 Difference]: With dead ends: 287 [2018-12-03 15:40:16,231 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 15:40:16,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 228 SyntacticMatches, 111 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10670 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=6609, Invalid=22121, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:40:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 15:40:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 15:40:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 15:40:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-12-03 15:40:16,298 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 170 [2018-12-03 15:40:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:16,298 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-12-03 15:40:16,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 15:40:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-12-03 15:40:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 15:40:16,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:16,299 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1, 1, 1] [2018-12-03 15:40:16,299 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:16,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1138018537, now seen corresponding path program 110 times [2018-12-03 15:40:16,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:16,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:16,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:17,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:17,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:17,737 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:17,737 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:40:17,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:17,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:40:17,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:40:18,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:40:18,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:18,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:18,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:20,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:20,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 61 [2018-12-03 15:40:20,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:20,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:40:20,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:40:20,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1775, Invalid=2007, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:40:20,456 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 62 states. [2018-12-03 15:40:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:22,266 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2018-12-03 15:40:22,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 15:40:22,266 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 171 [2018-12-03 15:40:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:22,267 INFO L225 Difference]: With dead ends: 180 [2018-12-03 15:40:22,267 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:40:22,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 283 SyntacticMatches, 112 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5253, Invalid=8789, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:40:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:40:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-12-03 15:40:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 15:40:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-12-03 15:40:22,332 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2018-12-03 15:40:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:22,332 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-12-03 15:40:22,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:40:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-12-03 15:40:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 15:40:22,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:22,333 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1] [2018-12-03 15:40:22,333 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:22,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1580913211, now seen corresponding path program 111 times [2018-12-03 15:40:22,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:22,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:22,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:26,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:26,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:26,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:26,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:26,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:26,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:40:26,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:40:26,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:40:26,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:26,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:26,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:30,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:30,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 115 [2018-12-03 15:40:30,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:30,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 15:40:30,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 15:40:30,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:40:30,020 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 116 states. [2018-12-03 15:40:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:33,868 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2018-12-03 15:40:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 15:40:33,868 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 173 [2018-12-03 15:40:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:33,869 INFO L225 Difference]: With dead ends: 292 [2018-12-03 15:40:33,869 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:40:33,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 232 SyntacticMatches, 113 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11060 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=6841, Invalid=22915, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 15:40:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:40:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 15:40:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:40:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-03 15:40:33,937 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 173 [2018-12-03 15:40:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:33,938 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-03 15:40:33,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 15:40:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-03 15:40:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 15:40:33,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:33,938 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1, 1, 1] [2018-12-03 15:40:33,938 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:33,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:33,939 INFO L82 PathProgramCache]: Analyzing trace with hash 690063342, now seen corresponding path program 112 times [2018-12-03 15:40:33,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:33,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:33,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:33,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:33,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:35,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:35,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:35,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:35,408 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:40:35,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:35,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:35,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:35,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:35,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:35,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:38,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:38,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 62 [2018-12-03 15:40:38,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:38,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:40:38,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:40:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:40:38,399 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 63 states. [2018-12-03 15:40:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:40,064 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-12-03 15:40:40,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-03 15:40:40,064 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 174 [2018-12-03 15:40:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:40,065 INFO L225 Difference]: With dead ends: 183 [2018-12-03 15:40:40,065 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:40:40,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 288 SyntacticMatches, 114 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6785 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5432, Invalid=9088, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 15:40:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:40:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-12-03 15:40:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:40:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 15:40:40,136 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-03 15:40:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:40,136 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 15:40:40,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:40:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 15:40:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 15:40:40,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:40,137 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1] [2018-12-03 15:40:40,137 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:40,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:40,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1725841290, now seen corresponding path program 113 times [2018-12-03 15:40:40,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:40,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:40,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:44,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:44,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:44,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:44,127 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:40:44,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:44,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:44,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:40:44,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:40:44,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 15:40:44,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:44,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:44,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:48,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:48,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117] total 117 [2018-12-03 15:40:48,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:48,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 15:40:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 15:40:48,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:40:48,492 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 118 states. [2018-12-03 15:40:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:53,323 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-12-03 15:40:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-12-03 15:40:53,324 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 176 [2018-12-03 15:40:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:53,324 INFO L225 Difference]: With dead ends: 297 [2018-12-03 15:40:53,324 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:40:53,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 236 SyntacticMatches, 115 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11457 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=7077, Invalid=23723, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:40:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:40:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 15:40:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 15:40:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-12-03 15:40:53,408 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 176 [2018-12-03 15:40:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:53,409 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-12-03 15:40:53,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 15:40:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-12-03 15:40:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 15:40:53,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:53,409 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1, 1, 1] [2018-12-03 15:40:53,409 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:53,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2063485121, now seen corresponding path program 114 times [2018-12-03 15:40:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:53,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:53,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:53,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:53,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:54,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:54,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:54,925 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:54,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:40:54,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:54,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:54,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:40:54,935 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:40:55,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:40:55,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:55,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:55,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:58,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:58,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 63 [2018-12-03 15:40:58,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:58,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:40:58,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:40:58,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:40:58,023 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 64 states. [2018-12-03 15:40:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:59,687 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-12-03 15:40:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 15:40:59,687 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 177 [2018-12-03 15:40:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:59,688 INFO L225 Difference]: With dead ends: 186 [2018-12-03 15:40:59,688 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 15:40:59,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 293 SyntacticMatches, 116 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7020 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5614, Invalid=9392, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 15:40:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 15:40:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-12-03 15:40:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 15:40:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-12-03 15:40:59,779 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2018-12-03 15:40:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:59,779 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-12-03 15:40:59,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:40:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-12-03 15:40:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 15:40:59,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:59,780 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1] [2018-12-03 15:40:59,780 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:59,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:59,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1265756259, now seen corresponding path program 115 times [2018-12-03 15:40:59,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:04,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:04,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:04,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:04,005 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:04,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:04,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:04,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:04,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:04,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:04,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:08,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:08,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 119 [2018-12-03 15:41:08,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:08,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 15:41:08,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 15:41:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:41:08,272 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 120 states. [2018-12-03 15:41:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:13,488 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-12-03 15:41:13,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-12-03 15:41:13,488 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 179 [2018-12-03 15:41:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:13,488 INFO L225 Difference]: With dead ends: 302 [2018-12-03 15:41:13,489 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:41:13,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 240 SyntacticMatches, 117 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11861 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=7317, Invalid=24545, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 15:41:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:41:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 15:41:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 15:41:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 15:41:13,561 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 179 [2018-12-03 15:41:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:13,562 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 15:41:13,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 15:41:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 15:41:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 15:41:13,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:13,562 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1, 1, 1] [2018-12-03 15:41:13,563 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:13,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1331794170, now seen corresponding path program 116 times [2018-12-03 15:41:13,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:13,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:13,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:13,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:15,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:15,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:15,138 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:15,138 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:15,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:15,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:15,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:15,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:15,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-12-03 15:41:15,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:15,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:15,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:18,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:18,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 64 [2018-12-03 15:41:18,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:18,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:41:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:41:18,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:41:18,453 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 65 states. [2018-12-03 15:41:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:20,221 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-12-03 15:41:20,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 15:41:20,221 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 180 [2018-12-03 15:41:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:20,222 INFO L225 Difference]: With dead ends: 189 [2018-12-03 15:41:20,222 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:41:20,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 298 SyntacticMatches, 118 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7259 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5799, Invalid=9701, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:41:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:41:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-12-03 15:41:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 15:41:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-03 15:41:20,298 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-03 15:41:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:20,299 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-03 15:41:20,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:41:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-03 15:41:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 15:41:20,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:20,299 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1] [2018-12-03 15:41:20,299 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:20,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash 45990050, now seen corresponding path program 117 times [2018-12-03 15:41:20,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:20,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:20,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:24,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:24,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:24,533 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:24,533 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:24,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:24,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:24,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:24,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:24,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:24,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:24,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:24,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:29,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:29,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121, 121] total 121 [2018-12-03 15:41:29,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:29,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 15:41:29,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 15:41:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:41:29,043 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 122 states. [2018-12-03 15:41:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:34,540 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-12-03 15:41:34,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-03 15:41:34,540 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 182 [2018-12-03 15:41:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:34,541 INFO L225 Difference]: With dead ends: 307 [2018-12-03 15:41:34,541 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 15:41:34,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 244 SyntacticMatches, 119 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12272 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=7561, Invalid=25381, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:41:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 15:41:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 15:41:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 15:41:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-12-03 15:41:34,637 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 182 [2018-12-03 15:41:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:34,637 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-12-03 15:41:34,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 15:41:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-12-03 15:41:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 15:41:34,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:34,638 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 1, 1, 1, 1] [2018-12-03 15:41:34,638 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:34,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -194394983, now seen corresponding path program 118 times [2018-12-03 15:41:34,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:34,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:36,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:36,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:36,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:36,211 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:36,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:36,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:36,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:36,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1830 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:39,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:39,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 65 [2018-12-03 15:41:39,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:39,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:41:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:41:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:41:39,470 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 66 states. [2018-12-03 15:41:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:41,317 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-12-03 15:41:41,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-12-03 15:41:41,317 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 183 [2018-12-03 15:41:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:41,318 INFO L225 Difference]: With dead ends: 192 [2018-12-03 15:41:41,318 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 15:41:41,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 303 SyntacticMatches, 120 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7502 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5987, Invalid=10015, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 15:41:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 15:41:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2018-12-03 15:41:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 15:41:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-12-03 15:41:41,398 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2018-12-03 15:41:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:41,398 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-12-03 15:41:41,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:41:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-12-03 15:41:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 15:41:41,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:41,399 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1] [2018-12-03 15:41:41,399 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:41,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2130051723, now seen corresponding path program 119 times [2018-12-03 15:41:41,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:41,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:41,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:41,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:45,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:45,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:45,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:45,850 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,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:45,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:45,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:45,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:46,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 15:41:46,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:46,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:46,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 3660 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123, 123] total 123 [2018-12-03 15:41:50,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:50,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 15:41:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 15:41:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11347, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:41:50,601 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 124 states. [2018-12-03 15:41:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:55,792 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2018-12-03 15:41:55,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-12-03 15:41:55,792 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 185 [2018-12-03 15:41:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:55,793 INFO L225 Difference]: With dead ends: 312 [2018-12-03 15:41:55,793 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:41:55,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 248 SyntacticMatches, 121 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12690 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=7809, Invalid=26231, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 15:41:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:41:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 15:41:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 15:41:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-03 15:41:55,885 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 185 [2018-12-03 15:41:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:55,885 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-03 15:41:55,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 15:41:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-03 15:41:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 15:41:55,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:55,886 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 1, 1, 1, 1] [2018-12-03 15:41:55,886 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:55,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 564879902, now seen corresponding path program 120 times [2018-12-03 15:41:55,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:55,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:55,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:57,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:57,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:57,508 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:57,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:57,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:57,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:57,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:57,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:57,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:57,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:57,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:57,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1891 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:00,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:00,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 66 [2018-12-03 15:42:00,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:00,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:42:00,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:42:00,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:42:00,821 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 67 states. [2018-12-03 15:42:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:02,690 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-12-03 15:42:02,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-12-03 15:42:02,690 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 186 [2018-12-03 15:42:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:02,691 INFO L225 Difference]: With dead ends: 195 [2018-12-03 15:42:02,691 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 15:42:02,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 308 SyntacticMatches, 122 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7749 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6178, Invalid=10334, Unknown=0, NotChecked=0, Total=16512 [2018-12-03 15:42:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 15:42:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-12-03 15:42:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 15:42:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-03 15:42:02,770 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-03 15:42:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:02,771 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-03 15:42:02,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:42:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-03 15:42:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 15:42:02,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:02,771 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1] [2018-12-03 15:42:02,771 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:02,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1683639738, now seen corresponding path program 121 times [2018-12-03 15:42:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:02,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:02,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:02,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:02,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:07,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:07,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:07,281 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:07,281 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:07,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:07,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:07,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:07,290 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:07,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:07,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 3782 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:11,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:11,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125, 125] total 125 [2018-12-03 15:42:11,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:11,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 15:42:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 15:42:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4031, Invalid=11719, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:42:11,817 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 126 states. [2018-12-03 15:42:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:17,521 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-12-03 15:42:17,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-12-03 15:42:17,521 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 188 [2018-12-03 15:42:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:17,522 INFO L225 Difference]: With dead ends: 317 [2018-12-03 15:42:17,522 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 15:42:17,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 252 SyntacticMatches, 123 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13115 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=8061, Invalid=27095, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:42:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 15:42:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 15:42:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 15:42:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-12-03 15:42:17,601 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 188 [2018-12-03 15:42:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:17,602 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-12-03 15:42:17,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 15:42:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-12-03 15:42:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 15:42:17,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:17,603 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 1, 1, 1, 1] [2018-12-03 15:42:17,603 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:17,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:17,603 INFO L82 PathProgramCache]: Analyzing trace with hash 568015985, now seen corresponding path program 122 times [2018-12-03 15:42:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:17,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:19,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:19,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:19,622 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:19,622 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:19,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:19,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:19,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:19,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:19,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-12-03 15:42:19,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:19,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:20,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 1953 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:22,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:22,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 67 [2018-12-03 15:42:22,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:22,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:42:22,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:42:22,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2150, Invalid=2406, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:42:22,807 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 68 states. [2018-12-03 15:42:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:24,979 INFO L93 Difference]: Finished difference Result 198 states and 199 transitions. [2018-12-03 15:42:24,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-12-03 15:42:24,979 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 189 [2018-12-03 15:42:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:24,980 INFO L225 Difference]: With dead ends: 198 [2018-12-03 15:42:24,980 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 15:42:24,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 313 SyntacticMatches, 124 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8000 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6372, Invalid=10658, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 15:42:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 15:42:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2018-12-03 15:42:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 15:42:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-12-03 15:42:25,067 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2018-12-03 15:42:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:25,068 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-12-03 15:42:25,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:42:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-12-03 15:42:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 15:42:25,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:25,069 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1] [2018-12-03 15:42:25,069 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:25,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash 402448205, now seen corresponding path program 123 times [2018-12-03 15:42:25,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:25,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:25,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:29,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:29,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:29,737 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:29,737 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:29,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:29,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:29,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:29,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:29,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:29,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:29,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:29,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 3906 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:34,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:34,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 127 [2018-12-03 15:42:34,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:34,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 15:42:34,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 15:42:34,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:42:34,414 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 128 states. [2018-12-03 15:42:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:40,518 INFO L93 Difference]: Finished difference Result 322 states and 324 transitions. [2018-12-03 15:42:40,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-03 15:42:40,519 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 191 [2018-12-03 15:42:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:40,519 INFO L225 Difference]: With dead ends: 322 [2018-12-03 15:42:40,519 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 15:42:40,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 256 SyntacticMatches, 125 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13547 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=8317, Invalid=27973, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 15:42:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 15:42:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 15:42:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 15:42:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-03 15:42:40,625 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 191 [2018-12-03 15:42:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:40,625 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-03 15:42:40,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 15:42:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-03 15:42:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 15:42:40,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:40,626 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 1, 1, 1, 1] [2018-12-03 15:42:40,626 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:40,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -687840970, now seen corresponding path program 124 times [2018-12-03 15:42:40,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:40,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:40,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:42,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:42,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:42,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:42,359 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:42,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:42,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:42,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:42,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:42,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 2016 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:45,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:45,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 68 [2018-12-03 15:42:45,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:45,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:42:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:42:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:42:45,798 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 69 states. [2018-12-03 15:42:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:47,852 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-12-03 15:42:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 15:42:47,852 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 192 [2018-12-03 15:42:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:47,853 INFO L225 Difference]: With dead ends: 201 [2018-12-03 15:42:47,853 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 15:42:47,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 318 SyntacticMatches, 126 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8255 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6569, Invalid=10987, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 15:42:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 15:42:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-12-03 15:42:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 15:42:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-03 15:42:47,938 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-03 15:42:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:47,939 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-03 15:42:47,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:42:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-03 15:42:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 15:42:47,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:47,939 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1] [2018-12-03 15:42:47,939 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:47,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:47,940 INFO L82 PathProgramCache]: Analyzing trace with hash 409724626, now seen corresponding path program 125 times [2018-12-03 15:42:47,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:47,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:47,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:47,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:52,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:52,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:52,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:52,671 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:52,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:52,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:52,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:52,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:53,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 15:42:53,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:53,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:53,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 4032 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:57,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:57,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 129 [2018-12-03 15:42:57,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:57,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 15:42:57,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 15:42:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4289, Invalid=12481, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:42:57,728 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 130 states. [2018-12-03 15:43:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:03,657 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2018-12-03 15:43:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-03 15:43:03,657 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 194 [2018-12-03 15:43:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:03,658 INFO L225 Difference]: With dead ends: 327 [2018-12-03 15:43:03,658 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 15:43:03,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 260 SyntacticMatches, 127 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13986 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=8577, Invalid=28865, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:43:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 15:43:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 15:43:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 15:43:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-12-03 15:43:03,751 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 194 [2018-12-03 15:43:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:03,751 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-12-03 15:43:03,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 15:43:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-12-03 15:43:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 15:43:03,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:03,752 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 1, 1, 1, 1] [2018-12-03 15:43:03,752 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:03,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1852395447, now seen corresponding path program 126 times [2018-12-03 15:43:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:03,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:03,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:03,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2080 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:05,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:05,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:05,691 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:05,691 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:05,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:05,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:05,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:05,700 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:05,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:05,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:05,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2080 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:06,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2016 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:09,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:09,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 72 [2018-12-03 15:43:09,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:09,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:43:09,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:43:09,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2363, Invalid=2893, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:43:09,058 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 71 states. [2018-12-03 15:43:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:11,439 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2018-12-03 15:43:11,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 15:43:11,440 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 195 [2018-12-03 15:43:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:11,441 INFO L225 Difference]: With dead ends: 204 [2018-12-03 15:43:11,441 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 15:43:11,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 321 SyntacticMatches, 127 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8779 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6779, Invalid=11853, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:43:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 15:43:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2018-12-03 15:43:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 15:43:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-12-03 15:43:11,534 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2018-12-03 15:43:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:11,534 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-12-03 15:43:11,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:43:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-12-03 15:43:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 15:43:11,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:11,535 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1] [2018-12-03 15:43:11,536 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:11,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2035630811, now seen corresponding path program 127 times [2018-12-03 15:43:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:11,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:11,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 4160 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:16,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:16,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:16,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:16,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:16,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:16,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:16,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:16,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:16,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 4160 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:16,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 4160 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:21,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:21,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131, 131] total 131 [2018-12-03 15:43:21,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:21,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 15:43:21,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 15:43:21,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4421, Invalid=12871, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:43:21,395 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 132 states. [2018-12-03 15:43:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:27,558 INFO L93 Difference]: Finished difference Result 332 states and 334 transitions. [2018-12-03 15:43:27,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-12-03 15:43:27,558 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 197 [2018-12-03 15:43:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:27,558 INFO L225 Difference]: With dead ends: 332 [2018-12-03 15:43:27,559 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 15:43:27,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 264 SyntacticMatches, 129 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14432 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=8841, Invalid=29771, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 15:43:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 15:43:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-03 15:43:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 15:43:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-12-03 15:43:27,648 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 197 [2018-12-03 15:43:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:27,648 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-12-03 15:43:27,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 15:43:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-12-03 15:43:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 15:43:27,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:27,649 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 1, 1, 1, 1] [2018-12-03 15:43:27,649 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:27,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash -522884018, now seen corresponding path program 128 times [2018-12-03 15:43:27,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:27,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:27,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 2145 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:29,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:29,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:29,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:29,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:29,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:29,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:29,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:29,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:29,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2018-12-03 15:43:29,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:29,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 2145 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:30,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 2080 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:33,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:33,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 73 [2018-12-03 15:43:33,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:33,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:43:33,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:43:33,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2432, Invalid=2970, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:43:33,296 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 72 states. [2018-12-03 15:43:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:35,657 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-12-03 15:43:35,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-12-03 15:43:35,657 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 198 [2018-12-03 15:43:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:35,658 INFO L225 Difference]: With dead ends: 207 [2018-12-03 15:43:35,658 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 15:43:35,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 326 SyntacticMatches, 129 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9046 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=6982, Invalid=12200, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:43:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 15:43:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2018-12-03 15:43:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 15:43:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-03 15:43:35,750 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-12-03 15:43:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:35,750 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-03 15:43:35,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:43:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-03 15:43:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 15:43:35,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:35,751 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1] [2018-12-03 15:43:35,751 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:35,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash 19565546, now seen corresponding path program 129 times [2018-12-03 15:43:35,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:35,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:35,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 4290 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:40,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:40,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:40,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:40,787 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:40,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:40,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:40,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:40,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:40,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:40,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:40,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 4290 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:41,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 4290 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:46,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:46,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133, 133] total 133 [2018-12-03 15:43:46,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:46,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 15:43:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 15:43:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13267, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:43:46,060 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 134 states. [2018-12-03 15:43:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:50,052 INFO L93 Difference]: Finished difference Result 337 states and 339 transitions. [2018-12-03 15:43:50,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-03 15:43:50,052 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 200 [2018-12-03 15:43:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:50,053 INFO L225 Difference]: With dead ends: 337 [2018-12-03 15:43:50,053 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 15:43:50,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 268 SyntacticMatches, 131 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14885 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=9109, Invalid=30691, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:43:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 15:43:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-12-03 15:43:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 15:43:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-12-03 15:43:50,142 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 200 [2018-12-03 15:43:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:50,142 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-12-03 15:43:50,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 15:43:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-12-03 15:43:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 15:43:50,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:50,143 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 1, 1, 1, 1] [2018-12-03 15:43:50,143 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:50,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash -832561119, now seen corresponding path program 130 times [2018-12-03 15:43:50,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:50,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:50,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2211 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:52,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:52,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:52,323 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:52,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:52,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:52,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:52,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:52,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:52,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2211 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:52,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 2145 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:56,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:56,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 74 [2018-12-03 15:43:56,137 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:56,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:43:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:43:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2502, Invalid=3048, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:43:56,138 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 73 states. [2018-12-03 15:43:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:58,257 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2018-12-03 15:43:58,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-12-03 15:43:58,258 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 201 [2018-12-03 15:43:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:58,258 INFO L225 Difference]: With dead ends: 210 [2018-12-03 15:43:58,258 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 15:43:58,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 331 SyntacticMatches, 131 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9317 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=7188, Invalid=12552, Unknown=0, NotChecked=0, Total=19740 [2018-12-03 15:43:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 15:43:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-12-03 15:43:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 15:43:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-12-03 15:43:58,369 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2018-12-03 15:43:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:58,370 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-12-03 15:43:58,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:43:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-12-03 15:43:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 15:43:58,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:58,370 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1] [2018-12-03 15:43:58,371 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:58,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:58,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1227385091, now seen corresponding path program 131 times [2018-12-03 15:43:58,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:58,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:58,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:58,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4422 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:03,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:03,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:03,436 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:03,436 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:03,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:03,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:03,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:03,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:03,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-12-03 15:44:03,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:03,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4422 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:03,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4422 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:08,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:08,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135, 135] total 135 [2018-12-03 15:44:08,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:08,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 15:44:08,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 15:44:08,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4691, Invalid=13669, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:44:08,896 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 136 states. [2018-12-03 15:44:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:15,486 INFO L93 Difference]: Finished difference Result 342 states and 344 transitions. [2018-12-03 15:44:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-12-03 15:44:15,486 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 203 [2018-12-03 15:44:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:15,487 INFO L225 Difference]: With dead ends: 342 [2018-12-03 15:44:15,487 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 15:44:15,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 272 SyntacticMatches, 133 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15345 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=9381, Invalid=31625, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 15:44:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 15:44:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-03 15:44:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 15:44:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-03 15:44:15,580 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 203 [2018-12-03 15:44:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:15,580 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-03 15:44:15,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 15:44:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-03 15:44:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 15:44:15,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:15,581 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 1, 1, 1, 1] [2018-12-03 15:44:15,581 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:15,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash 618824550, now seen corresponding path program 132 times [2018-12-03 15:44:15,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:15,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:15,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2278 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:17,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:17,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:17,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:17,932 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:17,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:17,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:17,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:17,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:18,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:18,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:18,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2278 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:18,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2211 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:22,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:22,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 75 [2018-12-03 15:44:22,269 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:22,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:44:22,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:44:22,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2573, Invalid=3127, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:44:22,270 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 74 states. [2018-12-03 15:44:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:24,498 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-12-03 15:44:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-12-03 15:44:24,499 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 204 [2018-12-03 15:44:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:24,500 INFO L225 Difference]: With dead ends: 213 [2018-12-03 15:44:24,500 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 15:44:24,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 336 SyntacticMatches, 133 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9592 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=7397, Invalid=12909, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:44:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 15:44:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-12-03 15:44:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 15:44:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-12-03 15:44:24,595 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-12-03 15:44:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:24,595 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-12-03 15:44:24,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:44:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-12-03 15:44:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 15:44:24,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:24,596 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1] [2018-12-03 15:44:24,596 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:24,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1984838914, now seen corresponding path program 133 times [2018-12-03 15:44:24,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:24,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:24,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 4556 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:29,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:29,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:29,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:29,896 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:29,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:29,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:29,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:30,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 4556 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:30,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 4556 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:35,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:35,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137, 137] total 137 [2018-12-03 15:44:35,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:35,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 15:44:35,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 15:44:35,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4829, Invalid=14077, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:44:35,224 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 138 states. [2018-12-03 15:44:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:42,325 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2018-12-03 15:44:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-12-03 15:44:42,325 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 206 [2018-12-03 15:44:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:42,326 INFO L225 Difference]: With dead ends: 347 [2018-12-03 15:44:42,326 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 15:44:42,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 276 SyntacticMatches, 135 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15812 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=9657, Invalid=32573, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:44:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 15:44:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-12-03 15:44:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 15:44:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-12-03 15:44:42,422 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 206 [2018-12-03 15:44:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:42,422 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-12-03 15:44:42,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 15:44:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-12-03 15:44:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 15:44:42,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:42,423 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 1, 1, 1, 1] [2018-12-03 15:44:42,423 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:42,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1065061369, now seen corresponding path program 134 times [2018-12-03 15:44:42,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:42,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2346 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:44,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:44,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:44,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:44,404 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,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:44,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:44,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:44,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:44,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2018-12-03 15:44:44,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:44,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2346 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:45,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2278 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 76 [2018-12-03 15:44:48,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:48,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:44:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:44:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2645, Invalid=3207, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:44:48,721 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 75 states. [2018-12-03 15:44:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:50,969 INFO L93 Difference]: Finished difference Result 216 states and 217 transitions. [2018-12-03 15:44:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-12-03 15:44:50,969 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 207 [2018-12-03 15:44:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:50,970 INFO L225 Difference]: With dead ends: 216 [2018-12-03 15:44:50,970 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 15:44:50,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 341 SyntacticMatches, 135 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9871 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7609, Invalid=13271, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 15:44:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 15:44:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2018-12-03 15:44:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 15:44:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-12-03 15:44:51,068 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2018-12-03 15:44:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:51,068 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-12-03 15:44:51,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:44:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-12-03 15:44:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-03 15:44:51,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:51,069 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1] [2018-12-03 15:44:51,069 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:51,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1321692373, now seen corresponding path program 135 times [2018-12-03 15:44:51,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:51,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:51,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 4692 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:56,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:56,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:56,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:56,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:56,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:56,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:56,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:56,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:56,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:56,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:56,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 4692 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:56,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 4692 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:02,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:02,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139, 139] total 139 [2018-12-03 15:45:02,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:02,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 15:45:02,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 15:45:02,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4969, Invalid=14491, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:45:02,059 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 140 states. [2018-12-03 15:45:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:09,395 INFO L93 Difference]: Finished difference Result 352 states and 354 transitions. [2018-12-03 15:45:09,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-12-03 15:45:09,395 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 209 [2018-12-03 15:45:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:09,396 INFO L225 Difference]: With dead ends: 352 [2018-12-03 15:45:09,396 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 15:45:09,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 280 SyntacticMatches, 137 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16286 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=9937, Invalid=33535, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 15:45:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 15:45:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 15:45:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 15:45:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-03 15:45:09,512 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 209 [2018-12-03 15:45:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:09,512 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-03 15:45:09,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 15:45:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-03 15:45:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 15:45:09,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:09,513 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 1, 1, 1, 1] [2018-12-03 15:45:09,513 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2120197758, now seen corresponding path program 136 times [2018-12-03 15:45:09,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:09,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:09,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 2415 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:11,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:11,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:11,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:11,498 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:11,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:11,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:11,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:11,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 2415 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:11,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 2346 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:15,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:15,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 77 [2018-12-03 15:45:15,693 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:15,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:45:15,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:45:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2718, Invalid=3288, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:45:15,694 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 76 states. [2018-12-03 15:45:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:18,228 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-12-03 15:45:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-12-03 15:45:18,228 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 210 [2018-12-03 15:45:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:18,228 INFO L225 Difference]: With dead ends: 219 [2018-12-03 15:45:18,229 INFO L226 Difference]: Without dead ends: 217 [2018-12-03 15:45:18,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 346 SyntacticMatches, 137 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10154 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=7824, Invalid=13638, Unknown=0, NotChecked=0, Total=21462 [2018-12-03 15:45:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-03 15:45:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2018-12-03 15:45:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 15:45:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-12-03 15:45:18,330 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-12-03 15:45:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:18,331 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-12-03 15:45:18,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:45:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-12-03 15:45:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 15:45:18,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:18,331 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1] [2018-12-03 15:45:18,332 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:18,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:18,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1695480346, now seen corresponding path program 137 times [2018-12-03 15:45:18,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:18,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:18,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:18,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:18,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 4830 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:23,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:23,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:23,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:23,931 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:23,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:23,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:23,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:23,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:24,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 15:45:24,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:24,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 4830 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:24,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 4830 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:29,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:29,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141, 141] total 141 [2018-12-03 15:45:29,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:29,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 15:45:29,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 15:45:29,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5111, Invalid=14911, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:45:29,876 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 142 states. [2018-12-03 15:45:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:35,599 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2018-12-03 15:45:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-12-03 15:45:35,599 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 212 [2018-12-03 15:45:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:35,600 INFO L225 Difference]: With dead ends: 357 [2018-12-03 15:45:35,600 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 15:45:35,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 284 SyntacticMatches, 139 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16767 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=10221, Invalid=34511, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 15:45:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 15:45:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-12-03 15:45:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-03 15:45:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2018-12-03 15:45:35,700 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 212 [2018-12-03 15:45:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:35,700 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2018-12-03 15:45:35,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 15:45:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2018-12-03 15:45:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-03 15:45:35,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:35,701 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 1, 1, 1, 1] [2018-12-03 15:45:35,701 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:35,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:35,702 INFO L82 PathProgramCache]: Analyzing trace with hash 145552337, now seen corresponding path program 138 times [2018-12-03 15:45:35,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:35,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:35,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:35,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:35,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 2485 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:37,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:37,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:37,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:37,832 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:37,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:37,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:37,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:37,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:38,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:38,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:38,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 2485 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:38,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 2415 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:41,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 78 [2018-12-03 15:45:41,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:41,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:45:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:45:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2792, Invalid=3370, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:45:41,839 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 77 states. [2018-12-03 15:45:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:44,480 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-12-03 15:45:44,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-12-03 15:45:44,481 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 213 [2018-12-03 15:45:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:44,481 INFO L225 Difference]: With dead ends: 222 [2018-12-03 15:45:44,481 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 15:45:44,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 351 SyntacticMatches, 139 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10441 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8042, Invalid=14010, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 15:45:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 15:45:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2018-12-03 15:45:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-03 15:45:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-12-03 15:45:44,606 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 213 [2018-12-03 15:45:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:44,607 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-12-03 15:45:44,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:45:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-12-03 15:45:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-03 15:45:44,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:44,607 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1, 1, 1] [2018-12-03 15:45:44,608 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:44,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:44,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1858191699, now seen corresponding path program 139 times [2018-12-03 15:45:44,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:44,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:44,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:44,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:44,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 4970 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:50,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:50,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:50,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:50,276 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:50,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:50,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:50,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:50,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:50,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 4970 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:50,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 4970 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:56,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:56,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143, 143] total 143 [2018-12-03 15:45:56,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:56,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 15:45:56,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 15:45:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=15337, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:45:56,192 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 144 states.