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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 09:57:33,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 09:57:33,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 09:57:33,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 09:57:33,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 09:57:33,039 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 09:57:33,040 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 09:57:33,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 09:57:33,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 09:57:33,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 09:57:33,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 09:57:33,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 09:57:33,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 09:57:33,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 09:57:33,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 09:57:33,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 09:57:33,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 09:57:33,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 09:57:33,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 09:57:33,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 09:57:33,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 09:57:33,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 09:57:33,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 09:57:33,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 09:57:33,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 09:57:33,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 09:57:33,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 09:57:33,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 09:57:33,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 09:57:33,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 09:57:33,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 09:57:33,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 09:57:33,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 09:57:33,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 09:57:33,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 09:57:33,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 09:57:33,071 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 [2019-01-20 09:57:33,084 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 09:57:33,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 09:57:33,085 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 09:57:33,085 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 09:57:33,085 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 09:57:33,086 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 09:57:33,086 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 09:57:33,086 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 09:57:33,086 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 09:57:33,086 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 09:57:33,087 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 09:57:33,087 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 09:57:33,087 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 09:57:33,087 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 09:57:33,088 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 09:57:33,088 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 09:57:33,088 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 09:57:33,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 09:57:33,089 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 09:57:33,089 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 09:57:33,089 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 09:57:33,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 09:57:33,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 09:57:33,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 09:57:33,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 09:57:33,090 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 09:57:33,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 09:57:33,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 09:57:33,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 09:57:33,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 09:57:33,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 09:57:33,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:33,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 09:57:33,092 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 09:57:33,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 09:57:33,092 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 09:57:33,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 09:57:33,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 09:57:33,094 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 09:57:33,094 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 09:57:33,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 09:57:33,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 09:57:33,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 09:57:33,163 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 09:57:33,163 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 09:57:33,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-01-20 09:57:33,164 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-20 09:57:33,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 09:57:33,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 09:57:33,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:33,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 09:57:33,206 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 09:57:33,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:33,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 09:57:33,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 09:57:33,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 09:57:33,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/1) ... [2019-01-20 09:57:33,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 09:57:33,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 09:57:33,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 09:57:33,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 09:57:33,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (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 [2019-01-20 09:57:33,336 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-20 09:57:33,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 09:57:33,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 09:57:33,718 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 09:57:33,719 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-20 09:57:33,720 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:33 BoogieIcfgContainer [2019-01-20 09:57:33,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 09:57:33,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 09:57:33,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 09:57:33,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 09:57:33,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:33" (1/2) ... [2019-01-20 09:57:33,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfe91e4 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:33, skipping insertion in model container [2019-01-20 09:57:33,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:33" (2/2) ... [2019-01-20 09:57:33,732 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-20 09:57:33,742 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 09:57:33,751 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 09:57:33,769 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 09:57:33,803 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 09:57:33,803 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 09:57:33,804 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 09:57:33,804 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 09:57:33,804 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 09:57:33,804 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 09:57:33,804 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 09:57:33,804 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 09:57:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-20 09:57:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 09:57:33,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:33,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 09:57:33,839 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-20 09:57:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:34,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:34,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 09:57:34,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:34,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 09:57:34,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 09:57:34,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 09:57:34,134 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-20 09:57:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:34,309 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-20 09:57:34,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 09:57:34,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-20 09:57:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:34,323 INFO L225 Difference]: With dead ends: 26 [2019-01-20 09:57:34,323 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 09:57:34,327 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 [2019-01-20 09:57:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 09:57:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-20 09:57:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 09:57:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-20 09:57:34,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-20 09:57:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:34,360 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-20 09:57:34,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 09:57:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-20 09:57:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 09:57:34,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:34,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 09:57:34,362 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-20 09:57:34,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:34,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:34,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:34,695 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-20 09:57:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:34,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:34,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-20 09:57:34,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:34,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 09:57:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 09:57:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 09:57:34,701 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-20 09:57:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:34,808 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-20 09:57:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 09:57:34,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-20 09:57:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:34,810 INFO L225 Difference]: With dead ends: 25 [2019-01-20 09:57:34,811 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 09:57:34,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 09:57:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 09:57:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-20 09:57:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 09:57:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-20 09:57:34,818 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-20 09:57:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:34,819 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-20 09:57:34,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 09:57:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-20 09:57:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 09:57:34,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:34,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 09:57:34,821 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-20 09:57:34,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:34,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:34,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 09:57:34,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:34,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 09:57:34,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:34,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 09:57:34,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 09:57:34,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:34,890 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-20 09:57:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:34,920 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-20 09:57:34,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 09:57:34,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-20 09:57:34,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:34,921 INFO L225 Difference]: With dead ends: 24 [2019-01-20 09:57:34,921 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 09:57:34,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 09:57:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-20 09:57:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 09:57:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-20 09:57:34,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-20 09:57:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:34,926 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-20 09:57:34,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 09:57:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-20 09:57:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 09:57:34,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:34,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 09:57:34,927 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-20 09:57:34,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:35,276 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-20 09:57:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:35,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 09:57:35,376 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-20 09:57:35,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:35,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:35,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:35,549 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 09:57:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:35,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:35,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,555 INFO L193 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 [2019-01-20 09:57:35,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:35,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:35,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:35,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-20 09:57:35,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:35,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 09:57:35,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 09:57:35,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-20 09:57:35,799 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-20 09:57:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:36,020 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-20 09:57:36,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 09:57:36,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-20 09:57:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:36,023 INFO L225 Difference]: With dead ends: 26 [2019-01-20 09:57:36,024 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 09:57:36,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-20 09:57:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 09:57:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-20 09:57:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 09:57:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-20 09:57:36,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-20 09:57:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:36,029 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-20 09:57:36,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 09:57:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-20 09:57:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-20 09:57:36,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:36,030 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 09:57:36,030 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-20 09:57:36,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:36,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:36,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:36,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-20 09:57:36,095 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-20 09:57:36,100 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:36,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:36,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:36,143 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2019-01-20 09:57:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:36,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:36,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,144 INFO L193 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 [2019-01-20 09:57:36,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:36,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:36,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-20 09:57:36,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:36,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 09:57:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 09:57:36,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-20 09:57:36,312 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-20 09:57:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:36,721 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-20 09:57:36,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 09:57:36,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-20 09:57:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:36,722 INFO L225 Difference]: With dead ends: 31 [2019-01-20 09:57:36,722 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 09:57:36,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-20 09:57:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 09:57:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-20 09:57:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 09:57:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-20 09:57:36,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-20 09:57:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:36,728 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-20 09:57:36,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 09:57:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-20 09:57:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 09:57:36,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:36,729 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 09:57:36,729 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-20 09:57:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:36,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:36,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:36,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:36,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:36,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,997 INFO L193 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 [2019-01-20 09:57:37,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:37,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:37,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 09:57:37,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:37,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:37,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:37,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:37,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-20 09:57:37,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:37,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 09:57:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 09:57:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-20 09:57:37,195 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-20 09:57:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:37,477 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-20 09:57:37,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 09:57:37,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-20 09:57:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:37,479 INFO L225 Difference]: With dead ends: 35 [2019-01-20 09:57:37,479 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 09:57:37,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-20 09:57:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 09:57:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-20 09:57:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 09:57:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-20 09:57:37,485 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-20 09:57:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:37,486 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-20 09:57:37,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 09:57:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-20 09:57:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 09:57:37,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:37,487 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-20 09:57:37,487 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-20 09:57:37,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:37,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:37,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:37,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:37,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:37,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:37,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:37,617 INFO L193 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 [2019-01-20 09:57:37,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:37,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:37,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:37,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:37,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:37,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:37,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:37,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-20 09:57:37,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:37,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 09:57:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 09:57:37,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-20 09:57:37,736 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-20 09:57:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:37,860 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-20 09:57:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 09:57:37,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-20 09:57:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:37,862 INFO L225 Difference]: With dead ends: 45 [2019-01-20 09:57:37,862 INFO L226 Difference]: Without dead ends: 26 [2019-01-20 09:57:37,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-20 09:57:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-20 09:57:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 09:57:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-20 09:57:37,867 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-20 09:57:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:37,868 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-20 09:57:37,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 09:57:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-20 09:57:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-20 09:57:37,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:37,869 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-20 09:57:37,869 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-20 09:57:37,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:37,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:38,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:38,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:38,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,085 INFO L193 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 [2019-01-20 09:57:38,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:38,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-20 09:57:38,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:38,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 09:57:38,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 09:57:38,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:38,263 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-20 09:57:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,741 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-20 09:57:38,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 09:57:38,741 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-20 09:57:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,742 INFO L225 Difference]: With dead ends: 49 [2019-01-20 09:57:38,743 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 09:57:38,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 09:57:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-20 09:57:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 09:57:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-20 09:57:38,750 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-20 09:57:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,750 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-20 09:57:38,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 09:57:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-20 09:57:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-20 09:57:38,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,751 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-20 09:57:38,752 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-20 09:57:38,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:38,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:38,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:38,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,912 INFO L193 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 [2019-01-20 09:57:38,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:38,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:38,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 09:57:38,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:38,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:39,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-20 09:57:39,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:39,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 09:57:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 09:57:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:39,171 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-20 09:57:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:39,454 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-20 09:57:39,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 09:57:39,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-20 09:57:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:39,455 INFO L225 Difference]: With dead ends: 60 [2019-01-20 09:57:39,455 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 09:57:39,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-20 09:57:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 09:57:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-20 09:57:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 09:57:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-20 09:57:39,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-20 09:57:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:39,460 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-20 09:57:39,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 09:57:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-20 09:57:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 09:57:39,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:39,461 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-20 09:57:39,461 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:39,462 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-20 09:57:39,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:39,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:39,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:39,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:39,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,780 INFO L193 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 [2019-01-20 09:57:39,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:39,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:39,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:39,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:39,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:40,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-20 09:57:40,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:40,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 09:57:40,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 09:57:40,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-20 09:57:40,024 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-20 09:57:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:40,757 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-20 09:57:40,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 09:57:40,761 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-20 09:57:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:40,762 INFO L225 Difference]: With dead ends: 64 [2019-01-20 09:57:40,762 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 09:57:40,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-01-20 09:57:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 09:57:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-20 09:57:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 09:57:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-20 09:57:40,769 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-20 09:57:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:40,769 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-20 09:57:40,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 09:57:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-20 09:57:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 09:57:40,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:40,771 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-20 09:57:40,771 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:40,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:40,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-20 09:57:40,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:40,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:40,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:40,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,934 INFO L193 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 [2019-01-20 09:57:40,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:40,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:41,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-20 09:57:41,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:41,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 09:57:41,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 09:57:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-20 09:57:41,577 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-20 09:57:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:41,887 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-20 09:57:41,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 09:57:41,887 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-20 09:57:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:41,888 INFO L225 Difference]: With dead ends: 75 [2019-01-20 09:57:41,888 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 09:57:41,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 09:57:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-20 09:57:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 09:57:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-20 09:57:41,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-20 09:57:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:41,897 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-20 09:57:41,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 09:57:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-20 09:57:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-20 09:57:41,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:41,898 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-20 09:57:41,898 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-20 09:57:41,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:42,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:42,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:42,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,143 INFO L193 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 [2019-01-20 09:57:42,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:42,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:42,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-20 09:57:42,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:42,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:43,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:43,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-20 09:57:43,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:43,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 09:57:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 09:57:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:43,431 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-20 09:57:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:45,544 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-20 09:57:45,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 09:57:45,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-20 09:57:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:45,545 INFO L225 Difference]: With dead ends: 97 [2019-01-20 09:57:45,545 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 09:57:45,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 09:57:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 09:57:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-20 09:57:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 09:57:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-20 09:57:45,555 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-20 09:57:45,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:45,555 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-20 09:57:45,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 09:57:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-20 09:57:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 09:57:45,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:45,556 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-20 09:57:45,557 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-20 09:57:45,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:45,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:45,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:45,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:45,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,975 INFO L193 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 [2019-01-20 09:57:45,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:45,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:45,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:45,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:46,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:46,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:46,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:46,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-20 09:57:46,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:46,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 09:57:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 09:57:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-20 09:57:46,363 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-20 09:57:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:47,653 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-20 09:57:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 09:57:47,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-20 09:57:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:47,655 INFO L225 Difference]: With dead ends: 94 [2019-01-20 09:57:47,656 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 09:57:47,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 09:57:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 09:57:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-20 09:57:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 09:57:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-20 09:57:47,665 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-20 09:57:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:47,665 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-20 09:57:47,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 09:57:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-20 09:57:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 09:57:47,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:47,667 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-20 09:57:47,668 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-20 09:57:47,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:47,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:47,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:47,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,814 INFO L193 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 [2019-01-20 09:57:47,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:47,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:47,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:48,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:48,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:48,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-20 09:57:48,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:48,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 09:57:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 09:57:48,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-20 09:57:48,165 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-20 09:57:48,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:48,433 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-20 09:57:48,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 09:57:48,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-20 09:57:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:48,435 INFO L225 Difference]: With dead ends: 105 [2019-01-20 09:57:48,435 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 09:57:48,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-01-20 09:57:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 09:57:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-20 09:57:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 09:57:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-20 09:57:48,445 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-20 09:57:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:48,445 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-20 09:57:48,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 09:57:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-20 09:57:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-20 09:57:48,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:48,446 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-20 09:57:48,447 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-20 09:57:48,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:48,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:48,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:48,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:48,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:49,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:49,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:49,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:49,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:49,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:49,550 INFO L193 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 [2019-01-20 09:57:49,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:49,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:49,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 09:57:49,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:49,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:49,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:49,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:49,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-20 09:57:49,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:49,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 09:57:49,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 09:57:49,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:49,931 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-20 09:57:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:51,212 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-20 09:57:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 09:57:51,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-20 09:57:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:51,214 INFO L225 Difference]: With dead ends: 109 [2019-01-20 09:57:51,214 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 09:57:51,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 09:57:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 09:57:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-20 09:57:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 09:57:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-20 09:57:51,224 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-20 09:57:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:51,225 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-20 09:57:51,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 09:57:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-20 09:57:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 09:57:51,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:51,226 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-20 09:57:51,226 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-20 09:57:51,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:51,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:51,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:51,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:51,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:51,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:51,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:51,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:51,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:51,464 INFO L193 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 [2019-01-20 09:57:51,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:51,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:51,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:51,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:51,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:51,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:51,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:51,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-20 09:57:51,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:51,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 09:57:51,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 09:57:51,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:51,810 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-20 09:57:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:52,232 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-20 09:57:52,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 09:57:52,236 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-20 09:57:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:52,237 INFO L225 Difference]: With dead ends: 120 [2019-01-20 09:57:52,237 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 09:57:52,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 09:57:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-20 09:57:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 09:57:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-20 09:57:52,249 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-20 09:57:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:52,249 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-20 09:57:52,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 09:57:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-20 09:57:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 09:57:52,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:52,250 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-20 09:57:52,251 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:52,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-20 09:57:52,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:52,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:52,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:52,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:52,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:52,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:52,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:52,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:52,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:52,614 INFO L193 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 [2019-01-20 09:57:52,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:52,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:52,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:52,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:52,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:52,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-20 09:57:52,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:52,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 09:57:52,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 09:57:52,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-20 09:57:52,998 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-20 09:57:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:54,505 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-20 09:57:54,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 09:57:54,505 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-20 09:57:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:54,506 INFO L225 Difference]: With dead ends: 124 [2019-01-20 09:57:54,506 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 09:57:54,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-20 09:57:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 09:57:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-20 09:57:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 09:57:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-20 09:57:54,517 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-20 09:57:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:54,517 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-20 09:57:54,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 09:57:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-20 09:57:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 09:57:54,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:54,518 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-20 09:57:54,519 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:54,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:54,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-20 09:57:54,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:54,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:54,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:54,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:54,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:54,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:54,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,721 INFO L193 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 [2019-01-20 09:57:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:54,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:54,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-20 09:57:54,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:54,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:54,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:55,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:55,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-20 09:57:55,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:55,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 09:57:55,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 09:57:55,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-20 09:57:55,155 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-20 09:57:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:55,713 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-20 09:57:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 09:57:55,714 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-20 09:57:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:55,714 INFO L225 Difference]: With dead ends: 135 [2019-01-20 09:57:55,715 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 09:57:55,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 09:57:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-20 09:57:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 09:57:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-20 09:57:55,735 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-20 09:57:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:55,735 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-20 09:57:55,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 09:57:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-20 09:57:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-20 09:57:55,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:55,740 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-20 09:57:55,740 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:55,741 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-20 09:57:55,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:55,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:55,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:56,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:56,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:56,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:56,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:56,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:56,226 INFO L193 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 [2019-01-20 09:57:56,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:56,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:56,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:56,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:56,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:56,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:56,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:56,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-20 09:57:56,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:56,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 09:57:56,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 09:57:56,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:56,642 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-20 09:57:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:58,429 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-20 09:57:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 09:57:58,429 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-20 09:57:58,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:58,430 INFO L225 Difference]: With dead ends: 139 [2019-01-20 09:57:58,430 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 09:57:58,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 09:57:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-20 09:57:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-20 09:57:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-20 09:57:58,440 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-20 09:57:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:58,441 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-20 09:57:58,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 09:57:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-20 09:57:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-20 09:57:58,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:58,442 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-20 09:57:58,442 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:58,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-20 09:57:58,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:58,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:58,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:58,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:58,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:58,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:58,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,887 INFO L193 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 [2019-01-20 09:57:58,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:58,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:59,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:59,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:59,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-20 09:57:59,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:59,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 09:57:59,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 09:57:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:59,715 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-20 09:58:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:00,125 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-20 09:58:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 09:58:00,125 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-20 09:58:00,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:00,126 INFO L225 Difference]: With dead ends: 150 [2019-01-20 09:58:00,126 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 09:58:00,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 09:58:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 09:58:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-20 09:58:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 09:58:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-20 09:58:00,138 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-20 09:58:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:00,139 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-20 09:58:00,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 09:58:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-20 09:58:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 09:58:00,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:00,140 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-20 09:58:00,140 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:00,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-20 09:58:00,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:00,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:00,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:00,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:00,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:00,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:00,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:00,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:00,649 INFO L193 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 [2019-01-20 09:58:00,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:00,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:00,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 09:58:00,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:00,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:01,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:02,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:02,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-20 09:58:02,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:02,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 09:58:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 09:58:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 09:58:02,302 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-20 09:58:05,059 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-20 09:58:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:07,050 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-20 09:58:07,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 09:58:07,051 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-20 09:58:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:07,052 INFO L225 Difference]: With dead ends: 192 [2019-01-20 09:58:07,052 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 09:58:07,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 09:58:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 09:58:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-20 09:58:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 09:58:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-20 09:58:07,067 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-20 09:58:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:07,068 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-20 09:58:07,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 09:58:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-20 09:58:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-20 09:58:07,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:07,068 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-20 09:58:07,068 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-20 09:58:07,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:07,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:07,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:07,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:07,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:07,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:07,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:07,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:07,595 INFO L193 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 [2019-01-20 09:58:07,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:07,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:07,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:07,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:07,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:08,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:08,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:08,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-20 09:58:08,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:08,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 09:58:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 09:58:08,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:58:08,117 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-20 09:58:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:10,402 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-20 09:58:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 09:58:10,405 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-20 09:58:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:10,406 INFO L225 Difference]: With dead ends: 169 [2019-01-20 09:58:10,406 INFO L226 Difference]: Without dead ends: 127 [2019-01-20 09:58:10,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 09:58:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-20 09:58:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-20 09:58:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 09:58:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-20 09:58:10,415 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-20 09:58:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:10,416 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-20 09:58:10,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 09:58:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-20 09:58:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-20 09:58:10,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:10,417 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-20 09:58:10,417 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:10,417 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-20 09:58:10,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:10,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:10,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:10,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:10,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:10,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:10,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:10,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:10,733 INFO L193 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 [2019-01-20 09:58:10,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:10,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:10,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:11,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:11,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:11,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-20 09:58:11,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:11,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 09:58:11,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 09:58:11,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:58:11,285 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-20 09:58:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:11,808 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-20 09:58:11,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 09:58:11,808 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-20 09:58:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:11,809 INFO L225 Difference]: With dead ends: 180 [2019-01-20 09:58:11,809 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 09:58:11,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:58:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 09:58:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-20 09:58:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 09:58:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-20 09:58:11,821 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-20 09:58:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:11,821 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-20 09:58:11,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 09:58:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-20 09:58:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 09:58:11,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:11,822 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-20 09:58:11,823 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:11,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-20 09:58:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:11,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:11,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:12,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:12,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:12,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:12,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:12,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:12,369 INFO L193 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 [2019-01-20 09:58:12,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:12,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:12,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 09:58:12,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:12,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:13,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:14,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:14,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-20 09:58:14,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:14,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 09:58:14,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 09:58:14,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-20 09:58:14,579 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-20 09:58:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:20,896 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-20 09:58:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 09:58:20,897 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-20 09:58:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:20,898 INFO L225 Difference]: With dead ends: 230 [2019-01-20 09:58:20,898 INFO L226 Difference]: Without dead ends: 135 [2019-01-20 09:58:20,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-20 09:58:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-20 09:58:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-20 09:58:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-20 09:58:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-20 09:58:20,916 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-20 09:58:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:20,916 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-20 09:58:20,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 09:58:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-20 09:58:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-20 09:58:20,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:20,917 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-20 09:58:20,917 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-20 09:58:20,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:20,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:20,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:21,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:21,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:21,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:21,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:21,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:21,535 INFO L193 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 [2019-01-20 09:58:21,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:21,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:21,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:21,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:21,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:22,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:22,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:22,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-20 09:58:22,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:22,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 09:58:22,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 09:58:22,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:58:22,144 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-20 09:58:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:25,422 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-20 09:58:25,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 09:58:25,423 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-20 09:58:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:25,424 INFO L225 Difference]: With dead ends: 199 [2019-01-20 09:58:25,424 INFO L226 Difference]: Without dead ends: 149 [2019-01-20 09:58:25,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-20 09:58:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-20 09:58:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 09:58:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-20 09:58:25,439 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-20 09:58:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:25,440 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-20 09:58:25,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 09:58:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-20 09:58:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-20 09:58:25,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:25,441 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-20 09:58:25,441 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:25,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-20 09:58:25,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:25,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:25,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:25,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:25,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:25,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:25,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,785 INFO L193 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 [2019-01-20 09:58:25,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:25,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:25,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:26,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:26,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:26,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-20 09:58:26,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:26,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 09:58:26,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 09:58:26,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:58:26,883 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-20 09:58:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:27,527 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-20 09:58:27,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 09:58:27,528 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-20 09:58:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:27,529 INFO L225 Difference]: With dead ends: 210 [2019-01-20 09:58:27,529 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 09:58:27,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:58:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 09:58:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-20 09:58:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 09:58:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-20 09:58:27,547 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-20 09:58:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:27,547 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-20 09:58:27,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 09:58:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-20 09:58:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 09:58:27,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:27,548 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-20 09:58:27,548 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-20 09:58:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:27,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:27,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:28,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:28,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:28,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:28,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:28,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:28,427 INFO L193 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 [2019-01-20 09:58:28,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:28,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:28,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-20 09:58:28,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:28,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:29,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:29,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:29,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-20 09:58:29,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:29,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 09:58:29,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 09:58:29,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 09:58:29,227 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-20 09:58:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:32,858 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-20 09:58:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 09:58:32,858 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-20 09:58:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:32,860 INFO L225 Difference]: With dead ends: 214 [2019-01-20 09:58:32,860 INFO L226 Difference]: Without dead ends: 160 [2019-01-20 09:58:32,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-20 09:58:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-20 09:58:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-20 09:58:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 09:58:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-20 09:58:32,875 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-20 09:58:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:32,875 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-20 09:58:32,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 09:58:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-20 09:58:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 09:58:32,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:32,876 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-20 09:58:32,876 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:32,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-20 09:58:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:32,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:32,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:32,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:32,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:33,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:33,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:33,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:33,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:33,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:33,478 INFO L193 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 [2019-01-20 09:58:33,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:33,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:33,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:33,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:33,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:33,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:34,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:34,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-20 09:58:34,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:34,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 09:58:34,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 09:58:34,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 09:58:34,181 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-20 09:58:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:34,793 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-20 09:58:34,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 09:58:34,793 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-20 09:58:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:34,794 INFO L225 Difference]: With dead ends: 225 [2019-01-20 09:58:34,794 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 09:58:34,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:58:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 09:58:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-20 09:58:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-20 09:58:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-20 09:58:34,809 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-20 09:58:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:34,809 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-20 09:58:34,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 09:58:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-20 09:58:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-20 09:58:34,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:34,810 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-20 09:58:34,810 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:34,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-20 09:58:34,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:34,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:34,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:34,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:34,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:36,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:36,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:36,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:36,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:36,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:36,045 INFO L193 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 [2019-01-20 09:58:36,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:36,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:36,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:36,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:36,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:36,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-20 09:58:36,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:36,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 09:58:36,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 09:58:36,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:58:36,828 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-20 09:58:41,510 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-20 09:58:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:41,824 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-20 09:58:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 09:58:41,825 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-20 09:58:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:41,826 INFO L225 Difference]: With dead ends: 229 [2019-01-20 09:58:41,826 INFO L226 Difference]: Without dead ends: 171 [2019-01-20 09:58:41,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-20 09:58:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-20 09:58:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-20 09:58:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-20 09:58:41,849 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-20 09:58:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:41,849 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-20 09:58:41,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 09:58:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-20 09:58:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-20 09:58:41,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:41,850 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-20 09:58:41,850 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-20 09:58:41,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:41,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:41,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:42,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:42,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:42,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:42,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:42,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:42,314 INFO L193 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 [2019-01-20 09:58:42,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:42,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:42,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 09:58:42,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:42,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:42,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-20 09:58:43,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:43,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 09:58:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 09:58:43,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:58:43,128 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-20 09:58:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:43,668 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-20 09:58:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 09:58:43,669 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-20 09:58:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:43,669 INFO L225 Difference]: With dead ends: 240 [2019-01-20 09:58:43,670 INFO L226 Difference]: Without dead ends: 117 [2019-01-20 09:58:43,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 09:58:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-20 09:58:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-20 09:58:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-20 09:58:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-20 09:58:43,691 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-20 09:58:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:43,691 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-20 09:58:43,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 09:58:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-20 09:58:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-20 09:58:43,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:43,692 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-20 09:58:43,692 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-20 09:58:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:43,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:43,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:43,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:43,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:44,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:44,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:44,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:44,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:44,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:44,530 INFO L193 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 [2019-01-20 09:58:44,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:44,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:44,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:44,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:44,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:45,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:45,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:45,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-20 09:58:45,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:45,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 09:58:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 09:58:45,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 09:58:45,382 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-20 09:58:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:50,616 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-20 09:58:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 09:58:50,623 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-20 09:58:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:50,624 INFO L225 Difference]: With dead ends: 244 [2019-01-20 09:58:50,624 INFO L226 Difference]: Without dead ends: 182 [2019-01-20 09:58:50,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-20 09:58:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-20 09:58:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-20 09:58:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-20 09:58:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-20 09:58:50,646 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-20 09:58:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:50,646 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-20 09:58:50,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 09:58:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-20 09:58:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-20 09:58:50,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:50,647 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-20 09:58:50,648 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-20 09:58:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:50,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:50,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:51,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:51,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:51,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:51,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:51,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:51,923 INFO L193 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 [2019-01-20 09:58:51,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:51,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:51,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:52,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:52,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:52,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-20 09:58:52,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:52,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 09:58:52,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 09:58:52,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 09:58:52,827 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-20 09:58:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:53,766 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-20 09:58:53,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 09:58:53,766 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-20 09:58:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:53,768 INFO L225 Difference]: With dead ends: 255 [2019-01-20 09:58:53,768 INFO L226 Difference]: Without dead ends: 124 [2019-01-20 09:58:53,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-20 09:58:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-20 09:58:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-20 09:58:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-20 09:58:53,787 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-20 09:58:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:53,787 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-20 09:58:53,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 09:58:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-20 09:58:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-20 09:58:53,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:53,788 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-20 09:58:53,788 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:53,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:53,788 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-20 09:58:53,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:53,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:53,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:55,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:55,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:55,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:55,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:55,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:55,110 INFO L193 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 [2019-01-20 09:58:55,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:55,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:55,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-20 09:58:55,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:55,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:57,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:59,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-20 09:58:59,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:59,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-20 09:58:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-20 09:58:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:59,310 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-20 09:59:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:09,698 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-20 09:59:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-20 09:59:09,698 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-20 09:59:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:09,699 INFO L225 Difference]: With dead ends: 325 [2019-01-20 09:59:09,699 INFO L226 Difference]: Without dead ends: 190 [2019-01-20 09:59:09,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 09:59:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-20 09:59:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-20 09:59:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-20 09:59:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-20 09:59:09,721 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-20 09:59:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:09,721 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-20 09:59:09,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-20 09:59:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-20 09:59:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-20 09:59:09,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:09,722 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-20 09:59:09,722 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:09,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-20 09:59:09,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:09,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:09,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:10,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:10,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:10,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:10,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:10,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:10,744 INFO L193 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 [2019-01-20 09:59:10,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:10,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:10,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:10,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:10,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:11,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:12,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:12,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-20 09:59:12,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:12,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 09:59:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 09:59:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 09:59:12,045 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-20 09:59:15,845 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-20 09:59:16,177 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-20 09:59:16,366 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-20 09:59:16,544 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-20 09:59:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:17,681 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-20 09:59:17,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 09:59:17,682 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-20 09:59:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:17,683 INFO L225 Difference]: With dead ends: 274 [2019-01-20 09:59:17,683 INFO L226 Difference]: Without dead ends: 204 [2019-01-20 09:59:17,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 09:59:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-20 09:59:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-20 09:59:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-20 09:59:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-20 09:59:17,710 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-20 09:59:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:17,710 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-20 09:59:17,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 09:59:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-20 09:59:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-20 09:59:17,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:17,711 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-20 09:59:17,711 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-20 09:59:17,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:17,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:17,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:17,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:18,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:18,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:18,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:18,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:18,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:18,329 INFO L193 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 [2019-01-20 09:59:18,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:18,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:18,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:18,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:19,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:19,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-20 09:59:19,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:19,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 09:59:19,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 09:59:19,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 09:59:19,460 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-20 09:59:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:20,337 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-20 09:59:20,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 09:59:20,337 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-20 09:59:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:20,338 INFO L225 Difference]: With dead ends: 285 [2019-01-20 09:59:20,338 INFO L226 Difference]: Without dead ends: 138 [2019-01-20 09:59:20,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:59:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-20 09:59:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-20 09:59:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-20 09:59:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-20 09:59:20,365 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-20 09:59:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:20,365 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-20 09:59:20,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 09:59:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-20 09:59:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-20 09:59:20,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:20,366 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-20 09:59:20,367 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-20 09:59:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:20,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:20,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:21,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:21,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:21,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:21,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:21,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:21,852 INFO L193 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 [2019-01-20 09:59:21,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:21,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:21,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 09:59:21,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:21,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:24,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:26,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-20 09:59:26,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:26,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 09:59:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 09:59:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:59:26,719 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-20 09:59:37,809 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-20 09:59:38,104 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-20 09:59:38,432 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-20 09:59:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:40,700 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-20 09:59:40,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-20 09:59:40,700 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-20 09:59:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:40,702 INFO L225 Difference]: With dead ends: 363 [2019-01-20 09:59:40,702 INFO L226 Difference]: Without dead ends: 212 [2019-01-20 09:59:40,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 09:59:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-20 09:59:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-20 09:59:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-20 09:59:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-20 09:59:40,729 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-20 09:59:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:40,729 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-20 09:59:40,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 09:59:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-20 09:59:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-20 09:59:40,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:40,730 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-20 09:59:40,730 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-20 09:59:40,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:40,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:40,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:42,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:42,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:42,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:42,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:42,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:42,350 INFO L193 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 [2019-01-20 09:59:42,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:42,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:42,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:42,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:42,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:43,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:43,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:43,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-20 09:59:43,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:43,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 09:59:43,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 09:59:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 09:59:43,677 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-20 09:59:48,088 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-20 09:59:48,366 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-20 09:59:48,625 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-20 09:59:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:50,541 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-20 09:59:50,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 09:59:50,542 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-20 09:59:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:50,543 INFO L225 Difference]: With dead ends: 304 [2019-01-20 09:59:50,543 INFO L226 Difference]: Without dead ends: 226 [2019-01-20 09:59:50,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-20 09:59:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-20 09:59:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-20 09:59:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-20 09:59:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-20 09:59:50,575 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-20 09:59:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:50,575 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-20 09:59:50,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 09:59:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-20 09:59:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-20 09:59:50,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:50,577 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-20 09:59:50,577 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-20 09:59:50,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:50,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:50,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:50,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:50,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:51,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:51,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:51,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:51,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:51,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:51,333 INFO L193 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 [2019-01-20 09:59:51,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:51,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:51,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:52,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:53,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:53,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-20 09:59:53,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:53,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 09:59:53,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 09:59:53,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 09:59:53,036 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-20 09:59:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:54,409 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-20 09:59:54,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 09:59:54,409 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-20 09:59:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:54,411 INFO L225 Difference]: With dead ends: 315 [2019-01-20 09:59:54,411 INFO L226 Difference]: Without dead ends: 152 [2019-01-20 09:59:54,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:59:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-20 09:59:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-20 09:59:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-20 09:59:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-20 09:59:54,445 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-20 09:59:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:54,446 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-20 09:59:54,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 09:59:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-20 09:59:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-20 09:59:54,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:54,447 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-20 09:59:54,447 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-20 09:59:54,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:54,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:54,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:54,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:54,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:55,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:55,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:55,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:55,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:55,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:55,975 INFO L193 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 [2019-01-20 09:59:55,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:55,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:56,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 09:59:56,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:56,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:59,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:01,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:01,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-20 10:00:01,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:01,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-20 10:00:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-20 10:00:01,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 10:00:01,841 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-20 10:00:14,012 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-20 10:00:14,310 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-20 10:00:14,612 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-20 10:00:14,890 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:00:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:17,544 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-20 10:00:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-20 10:00:17,545 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-20 10:00:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:17,546 INFO L225 Difference]: With dead ends: 401 [2019-01-20 10:00:17,547 INFO L226 Difference]: Without dead ends: 234 [2019-01-20 10:00:17,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-20 10:00:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-20 10:00:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-20 10:00:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-20 10:00:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-20 10:00:17,575 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-20 10:00:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:17,576 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-20 10:00:17,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-20 10:00:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-20 10:00:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-20 10:00:17,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:17,577 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-20 10:00:17,577 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-20 10:00:17,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:17,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:17,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:17,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:17,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:19,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:19,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:19,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:19,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:19,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:19,795 INFO L193 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 [2019-01-20 10:00:19,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:19,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:19,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:19,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:19,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:22,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:22,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:22,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-20 10:00:22,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:22,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:00:22,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:00:22,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:00:22,203 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-20 10:00:28,186 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-20 10:00:28,507 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-20 10:00:28,814 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-20 10:00:29,015 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:00:29,212 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:00:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:31,248 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-20 10:00:31,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:00:31,248 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-20 10:00:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:31,250 INFO L225 Difference]: With dead ends: 334 [2019-01-20 10:00:31,250 INFO L226 Difference]: Without dead ends: 248 [2019-01-20 10:00:31,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-20 10:00:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-20 10:00:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-20 10:00:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-20 10:00:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-20 10:00:31,278 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-20 10:00:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:31,279 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-20 10:00:31,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:00:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-20 10:00:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-20 10:00:31,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:31,280 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-20 10:00:31,280 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:31,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-20 10:00:31,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:31,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:31,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:31,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:31,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:32,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:32,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:32,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:32,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:32,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:32,560 INFO L193 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 [2019-01-20 10:00:32,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:32,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:32,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:33,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:34,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-20 10:00:34,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:34,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:00:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:00:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:00:34,469 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-20 10:00:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:36,130 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-20 10:00:36,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 10:00:36,132 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-20 10:00:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:36,133 INFO L225 Difference]: With dead ends: 345 [2019-01-20 10:00:36,133 INFO L226 Difference]: Without dead ends: 166 [2019-01-20 10:00:36,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:00:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-20 10:00:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-20 10:00:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-20 10:00:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-20 10:00:36,160 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-20 10:00:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:36,160 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-20 10:00:36,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:00:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-20 10:00:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-20 10:00:36,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:36,161 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-20 10:00:36,161 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-20 10:00:36,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:36,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:36,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:37,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:37,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:37,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:37,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:37,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:37,926 INFO L193 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 [2019-01-20 10:00:37,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:37,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:38,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-20 10:00:38,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:38,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:39,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:39,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:39,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-20 10:00:39,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:39,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:00:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:00:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:00:39,699 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-20 10:00:46,837 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-20 10:00:47,171 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-20 10:00:47,494 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-20 10:00:47,708 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:00:47,912 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:00:48,105 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:00:48,298 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:00:48,535 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-20 10:00:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:50,202 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-20 10:00:50,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:00:50,202 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-20 10:00:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:50,204 INFO L225 Difference]: With dead ends: 349 [2019-01-20 10:00:50,204 INFO L226 Difference]: Without dead ends: 259 [2019-01-20 10:00:50,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 10:00:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-20 10:00:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-20 10:00:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-20 10:00:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-20 10:00:50,235 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-20 10:00:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:50,235 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-20 10:00:50,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:00:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-20 10:00:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-20 10:00:50,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:50,236 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-20 10:00:50,236 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-20 10:00:50,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:50,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:50,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:50,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:50,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:51,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:51,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:51,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:51,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:51,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:51,262 INFO L193 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 [2019-01-20 10:00:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:51,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:51,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:51,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:51,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:52,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:53,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:53,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-20 10:00:53,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:53,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:00:53,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:00:53,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:00:53,026 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-20 10:00:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:55,131 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-20 10:00:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 10:00:55,131 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-20 10:00:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:55,132 INFO L225 Difference]: With dead ends: 360 [2019-01-20 10:00:55,132 INFO L226 Difference]: Without dead ends: 173 [2019-01-20 10:00:55,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 10:00:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-20 10:00:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-20 10:00:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-20 10:00:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-20 10:00:55,163 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-20 10:00:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:55,164 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-20 10:00:55,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:00:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-20 10:00:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-20 10:00:55,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:55,165 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-20 10:00:55,165 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:55,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-20 10:00:55,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:55,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:55,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:55,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:55,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:57,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:57,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:57,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:57,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:57,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:57,200 INFO L193 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 [2019-01-20 10:00:57,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:57,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:57,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:59,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:59,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:59,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-20 10:00:59,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:59,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:00:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:00:59,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 10:00:59,195 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-20 10:01:06,864 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-20 10:01:07,228 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-20 10:01:07,578 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-20 10:01:07,817 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:01:08,051 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:01:08,262 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:01:08,470 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:01:08,882 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-20 10:01:09,107 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-20 10:01:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:10,718 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-20 10:01:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:01:10,718 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-20 10:01:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:10,720 INFO L225 Difference]: With dead ends: 364 [2019-01-20 10:01:10,720 INFO L226 Difference]: Without dead ends: 270 [2019-01-20 10:01:10,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-20 10:01:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-20 10:01:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-20 10:01:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-20 10:01:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-20 10:01:10,753 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-20 10:01:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:10,753 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-20 10:01:10,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:01:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-20 10:01:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-20 10:01:10,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:10,754 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-20 10:01:10,754 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-20 10:01:10,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:10,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:10,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:10,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:10,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:12,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:12,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:12,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:12,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:12,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:12,346 INFO L193 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 [2019-01-20 10:01:12,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:12,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:12,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 10:01:12,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:12,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:13,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:14,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:14,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-20 10:01:14,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:14,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:01:14,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:01:14,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 10:01:14,828 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-20 10:01:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:16,693 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-20 10:01:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 10:01:16,694 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-20 10:01:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:16,695 INFO L225 Difference]: With dead ends: 375 [2019-01-20 10:01:16,695 INFO L226 Difference]: Without dead ends: 180 [2019-01-20 10:01:16,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 10:01:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-20 10:01:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-20 10:01:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-20 10:01:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-20 10:01:16,725 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-20 10:01:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:16,725 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-20 10:01:16,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:01:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-20 10:01:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-20 10:01:16,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:16,726 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-20 10:01:16,726 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-20 10:01:16,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:16,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:16,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:16,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:18,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:18,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:18,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:18,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,321 INFO L193 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 [2019-01-20 10:01:18,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:18,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:18,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:18,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:18,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:20,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:20,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:20,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-20 10:01:20,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:20,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:01:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:01:20,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:01:20,498 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-20 10:01:27,071 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-20 10:01:27,442 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-20 10:01:27,816 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-20 10:01:28,068 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:01:28,306 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:01:28,541 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:01:28,752 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:01:28,965 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:01:29,405 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-20 10:01:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:31,295 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-20 10:01:31,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:01:31,295 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-20 10:01:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:31,296 INFO L225 Difference]: With dead ends: 379 [2019-01-20 10:01:31,296 INFO L226 Difference]: Without dead ends: 281 [2019-01-20 10:01:31,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:01:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-20 10:01:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-20 10:01:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-20 10:01:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-20 10:01:31,338 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-20 10:01:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:31,338 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-20 10:01:31,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:01:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-20 10:01:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-20 10:01:31,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:31,339 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-20 10:01:31,339 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:31,340 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-20 10:01:31,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:31,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:31,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:31,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:31,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:32,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:32,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:32,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:32,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:32,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:32,290 INFO L193 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 [2019-01-20 10:01:32,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:32,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:32,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:33,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:34,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:34,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-20 10:01:34,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:34,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:01:34,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:01:34,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:01:34,298 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-20 10:01:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:36,480 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-20 10:01:36,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 10:01:36,481 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-20 10:01:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:36,482 INFO L225 Difference]: With dead ends: 390 [2019-01-20 10:01:36,482 INFO L226 Difference]: Without dead ends: 187 [2019-01-20 10:01:36,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:01:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-20 10:01:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-20 10:01:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-20 10:01:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-20 10:01:36,532 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-20 10:01:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:36,532 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-20 10:01:36,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:01:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-20 10:01:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-20 10:01:36,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:36,533 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-20 10:01:36,533 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-20 10:01:36,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:36,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:36,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:36,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:36,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:38,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:38,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:38,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:38,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:38,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:38,918 INFO L193 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 [2019-01-20 10:01:38,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:38,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:38,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-20 10:01:38,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:38,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:43,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:47,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:47,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-20 10:01:47,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:47,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-20 10:01:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-20 10:01:47,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-20 10:01:47,766 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-20 10:02:05,802 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-20 10:02:06,262 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-20 10:02:06,732 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-20 10:02:07,113 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:02:07,484 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:02:07,845 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:02:08,186 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:02:08,502 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:02:08,808 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:02:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:11,968 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-20 10:02:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-20 10:02:11,968 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-20 10:02:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:11,970 INFO L225 Difference]: With dead ends: 496 [2019-01-20 10:02:11,970 INFO L226 Difference]: Without dead ends: 289 [2019-01-20 10:02:11,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-20 10:02:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-20 10:02:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-20 10:02:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-20 10:02:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-20 10:02:12,008 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-20 10:02:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:12,008 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-20 10:02:12,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-20 10:02:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-20 10:02:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-20 10:02:12,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:12,009 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-20 10:02:12,009 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-20 10:02:12,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:14,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:14,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:14,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:14,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:14,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:14,248 INFO L193 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 [2019-01-20 10:02:14,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:14,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:14,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:14,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:14,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:16,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:16,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:16,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-20 10:02:16,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:16,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:02:16,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:02:16,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:02:16,872 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-20 10:02:25,319 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-20 10:02:25,780 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-20 10:02:26,268 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-20 10:02:26,543 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:02:26,805 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:02:27,064 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:02:27,309 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:02:27,545 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:02:27,774 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:02:27,995 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:02:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:30,286 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-20 10:02:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-20 10:02:30,287 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-20 10:02:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:30,288 INFO L225 Difference]: With dead ends: 409 [2019-01-20 10:02:30,289 INFO L226 Difference]: Without dead ends: 303 [2019-01-20 10:02:30,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:02:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-20 10:02:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-20 10:02:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-20 10:02:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-20 10:02:30,327 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-20 10:02:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:30,327 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-20 10:02:30,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:02:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-20 10:02:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-20 10:02:30,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:30,328 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-20 10:02:30,328 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-20 10:02:30,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:30,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:30,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:30,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:30,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:31,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:31,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:31,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:31,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:31,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:31,627 INFO L193 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 [2019-01-20 10:02:31,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:31,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:31,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:35,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:36,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:36,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-20 10:02:36,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:36,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:02:36,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:02:36,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:02:36,144 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-20 10:02:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:38,416 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-20 10:02:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 10:02:38,417 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-20 10:02:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:38,418 INFO L225 Difference]: With dead ends: 420 [2019-01-20 10:02:38,418 INFO L226 Difference]: Without dead ends: 201 [2019-01-20 10:02:38,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 10:02:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-20 10:02:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-20 10:02:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-20 10:02:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-20 10:02:38,456 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-20 10:02:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:38,456 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-20 10:02:38,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:02:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-20 10:02:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-20 10:02:38,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:38,457 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-20 10:02:38,457 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:38,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:38,457 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-20 10:02:38,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:38,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:38,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:38,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:38,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:40,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:40,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:40,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:40,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:40,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:40,378 INFO L193 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 [2019-01-20 10:02:40,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:40,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:40,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-20 10:02:40,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:40,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:42,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:42,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:42,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-20 10:02:42,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:42,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:02:42,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:02:42,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 10:02:42,895 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-20 10:02:51,412 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-20 10:02:51,826 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-20 10:02:52,223 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-20 10:02:52,522 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:02:52,800 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:02:53,066 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:02:53,319 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:02:53,562 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:02:53,813 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:02:54,044 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:02:54,284 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:02:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:56,855 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-20 10:02:56,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-20 10:02:56,855 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-20 10:02:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:56,857 INFO L225 Difference]: With dead ends: 424 [2019-01-20 10:02:56,857 INFO L226 Difference]: Without dead ends: 314 [2019-01-20 10:02:56,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-20 10:02:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-20 10:02:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-20 10:02:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-20 10:02:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-20 10:02:56,908 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-20 10:02:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:56,908 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-20 10:02:56,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:02:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-20 10:02:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-20 10:02:56,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:56,910 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-20 10:02:56,910 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-20 10:02:56,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:56,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:56,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:58,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:58,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:58,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:58,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:58,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:58,020 INFO L193 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 [2019-01-20 10:02:58,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:58,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:58,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:58,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:58,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:59,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:00,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:00,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-20 10:03:00,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:00,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:03:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:03:00,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 10:03:00,540 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-20 10:03:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:03,256 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-20 10:03:03,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 10:03:03,256 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-20 10:03:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:03,257 INFO L225 Difference]: With dead ends: 435 [2019-01-20 10:03:03,257 INFO L226 Difference]: Without dead ends: 208 [2019-01-20 10:03:03,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:03:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-20 10:03:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-20 10:03:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-20 10:03:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-20 10:03:03,307 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-20 10:03:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:03,307 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-20 10:03:03,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:03:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-20 10:03:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-20 10:03:03,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:03,309 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-20 10:03:03,309 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-20 10:03:03,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:03,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:03,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:05,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:05,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:05,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:05,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:05,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:05,319 INFO L193 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 [2019-01-20 10:03:05,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:05,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:05,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:07,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:07,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:07,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-20 10:03:07,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:07,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:03:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:03:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:03:07,944 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-20 10:03:17,075 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-20 10:03:17,559 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-20 10:03:17,994 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-20 10:03:18,300 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:03:18,587 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:03:18,865 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:03:19,138 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:03:19,412 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:03:19,662 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:03:19,908 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:03:20,142 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:03:20,362 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:03:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:22,963 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-20 10:03:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-20 10:03:22,963 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-20 10:03:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:22,965 INFO L225 Difference]: With dead ends: 439 [2019-01-20 10:03:22,965 INFO L226 Difference]: Without dead ends: 325 [2019-01-20 10:03:22,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:03:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-20 10:03:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-20 10:03:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-20 10:03:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-20 10:03:23,024 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-20 10:03:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:23,025 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-20 10:03:23,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:03:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-20 10:03:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-20 10:03:23,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:23,026 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-20 10:03:23,027 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-20 10:03:23,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:23,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:23,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:23,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:23,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:24,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:24,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:24,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:24,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:24,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:24,243 INFO L193 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 [2019-01-20 10:03:24,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:24,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:24,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-20 10:03:24,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:24,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:25,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:26,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:26,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-20 10:03:26,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:26,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:03:26,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:03:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:03:26,999 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-20 10:03:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:29,795 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-20 10:03:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:03:29,795 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-20 10:03:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:29,797 INFO L225 Difference]: With dead ends: 450 [2019-01-20 10:03:29,798 INFO L226 Difference]: Without dead ends: 215 [2019-01-20 10:03:29,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 10:03:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-20 10:03:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-20 10:03:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-20 10:03:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-20 10:03:29,847 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-20 10:03:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:29,847 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-20 10:03:29,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:03:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-20 10:03:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-20 10:03:29,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:29,848 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-20 10:03:29,848 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:29,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-20 10:03:29,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:29,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:29,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:31,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:31,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:31,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:31,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:31,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:31,970 INFO L193 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 [2019-01-20 10:03:31,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:31,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:32,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:32,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:32,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:34,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:34,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:34,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-20 10:03:34,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:34,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:03:34,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:03:34,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:03:34,928 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-20 10:03:45,196 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-20 10:03:45,647 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-20 10:03:46,102 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-20 10:03:46,430 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:03:46,734 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:03:47,173 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:03:47,458 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:03:47,822 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:03:48,101 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:03:48,360 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:03:48,614 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:03:48,856 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:03:49,098 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:03:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:51,599 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-20 10:03:51,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-20 10:03:51,599 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-20 10:03:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:51,602 INFO L225 Difference]: With dead ends: 454 [2019-01-20 10:03:51,602 INFO L226 Difference]: Without dead ends: 336 [2019-01-20 10:03:51,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-20 10:03:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-20 10:03:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-20 10:03:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-20 10:03:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-20 10:03:51,657 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-20 10:03:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:51,657 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-20 10:03:51,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:03:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-20 10:03:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-20 10:03:51,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:51,658 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-20 10:03:51,658 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-20 10:03:51,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:51,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:51,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:53,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:53,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:53,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:53,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:53,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:53,035 INFO L193 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 [2019-01-20 10:03:53,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:53,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:53,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:54,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:55,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:55,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-20 10:03:55,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:55,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:03:55,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:03:55,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:03:55,734 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-20 10:03:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:58,702 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-20 10:03:58,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:03:58,702 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-20 10:03:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:58,703 INFO L225 Difference]: With dead ends: 465 [2019-01-20 10:03:58,703 INFO L226 Difference]: Without dead ends: 222 [2019-01-20 10:03:58,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:03:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-20 10:03:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-20 10:03:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-20 10:03:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-20 10:03:58,747 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-20 10:03:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:58,747 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-20 10:03:58,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:03:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-20 10:03:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-20 10:03:58,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:58,748 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-20 10:03:58,748 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-20 10:03:58,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:58,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:58,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:58,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:58,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:00,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:00,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:00,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:00,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:00,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:00,949 INFO L193 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 [2019-01-20 10:04:00,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:00,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:01,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-20 10:04:01,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:01,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:07,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:12,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:12,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-20 10:04:12,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:12,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-20 10:04:12,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-20 10:04:12,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:04:12,754 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-20 10:04:37,177 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-20 10:04:37,751 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-20 10:04:38,363 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-20 10:04:38,951 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:04:39,480 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:04:39,964 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:04:40,437 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:04:40,891 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:04:41,336 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:04:41,765 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:04:42,165 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:04:42,557 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:04:42,957 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:04:43,315 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:04:44,023 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-20 10:04:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:47,000 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-20 10:04:47,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-20 10:04:47,000 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-20 10:04:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:47,001 INFO L225 Difference]: With dead ends: 591 [2019-01-20 10:04:47,001 INFO L226 Difference]: Without dead ends: 344 [2019-01-20 10:04:47,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-20 10:04:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-20 10:04:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-20 10:04:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-20 10:04:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-20 10:04:47,049 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-20 10:04:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:47,049 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-20 10:04:47,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-20 10:04:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-20 10:04:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-20 10:04:47,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:47,050 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-20 10:04:47,050 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-20 10:04:47,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:47,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:47,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:47,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:47,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:49,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:49,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:49,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:49,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:49,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:49,507 INFO L193 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 [2019-01-20 10:04:49,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:49,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:49,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:49,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:49,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:52,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:52,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:52,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-20 10:04:52,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:52,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:04:52,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:04:52,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 10:04:52,305 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-20 10:05:05,475 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-20 10:05:05,989 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-20 10:05:06,488 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-20 10:05:06,835 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:05:07,179 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:05:07,504 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:05:07,828 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:05:08,145 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:05:08,445 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:05:08,741 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:05:09,026 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:05:09,300 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:05:09,625 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:05:09,934 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:05:10,186 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:05:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:12,833 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-20 10:05:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-20 10:05:12,834 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-20 10:05:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:12,835 INFO L225 Difference]: With dead ends: 484 [2019-01-20 10:05:12,836 INFO L226 Difference]: Without dead ends: 358 [2019-01-20 10:05:12,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-20 10:05:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-20 10:05:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-20 10:05:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-20 10:05:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-20 10:05:12,888 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-20 10:05:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:12,888 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-20 10:05:12,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:05:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-20 10:05:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-20 10:05:12,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:12,889 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-20 10:05:12,890 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:12,890 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-20 10:05:12,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:12,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:12,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:14,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:14,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:14,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:14,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:14,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:14,450 INFO L193 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 [2019-01-20 10:05:14,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:14,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:14,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:16,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:18,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:18,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-20 10:05:18,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:18,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:05:18,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:05:18,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 10:05:18,027 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-20 10:05:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:20,583 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-20 10:05:20,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:05:20,583 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-20 10:05:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:20,584 INFO L225 Difference]: With dead ends: 495 [2019-01-20 10:05:20,585 INFO L226 Difference]: Without dead ends: 236 [2019-01-20 10:05:20,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:05:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-20 10:05:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-20 10:05:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-20 10:05:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-20 10:05:20,638 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-20 10:05:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:20,639 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-20 10:05:20,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:05:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-20 10:05:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-20 10:05:20,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:20,640 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-20 10:05:20,640 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-20 10:05:20,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:20,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:20,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:23,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:23,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:23,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:23,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:23,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:23,149 INFO L193 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 [2019-01-20 10:05:23,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:23,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:23,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-20 10:05:23,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:23,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:29,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:36,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:36,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-20 10:05:36,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:36,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-20 10:05:36,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-20 10:05:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:05:36,389 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-20 10:06:01,709 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-20 10:06:02,303 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-20 10:06:02,982 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-20 10:06:03,516 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:06:04,051 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:06:04,573 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:06:05,078 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:06:05,571 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:06:06,133 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:06:06,594 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:06:07,038 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:06:07,471 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:06:07,885 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:06:08,284 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:06:08,664 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:06:09,059 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:06:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:12,825 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-20 10:06:12,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-20 10:06:12,825 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-20 10:06:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:12,827 INFO L225 Difference]: With dead ends: 629 [2019-01-20 10:06:12,827 INFO L226 Difference]: Without dead ends: 366 [2019-01-20 10:06:12,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-20 10:06:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-20 10:06:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-20 10:06:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-20 10:06:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-20 10:06:12,881 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-20 10:06:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:12,881 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-20 10:06:12,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-20 10:06:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-20 10:06:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-20 10:06:12,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:12,882 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-20 10:06:12,883 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-20 10:06:12,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:12,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:12,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:12,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:12,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:15,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:15,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:15,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:15,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:15,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:15,525 INFO L193 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 [2019-01-20 10:06:15,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:15,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:15,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:15,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:15,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:18,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:18,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:18,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-20 10:06:18,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:18,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:06:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:06:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 10:06:18,898 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-20 10:06:30,706 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-20 10:06:31,258 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-20 10:06:31,901 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-20 10:06:32,276 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:06:32,661 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:06:33,008 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:06:33,361 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:06:33,694 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:06:34,029 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:06:34,347 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:06:34,665 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:06:34,967 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:06:35,264 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:06:35,552 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:06:35,826 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:06:36,085 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:06:36,337 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:06:36,635 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:06:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:39,203 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-20 10:06:39,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-20 10:06:39,204 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-20 10:06:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:39,205 INFO L225 Difference]: With dead ends: 514 [2019-01-20 10:06:39,205 INFO L226 Difference]: Without dead ends: 380 [2019-01-20 10:06:39,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:06:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-20 10:06:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-20 10:06:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-20 10:06:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-20 10:06:39,278 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-20 10:06:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:39,278 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-20 10:06:39,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:06:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-20 10:06:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-20 10:06:39,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:39,279 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-20 10:06:39,279 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-20 10:06:39,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:39,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:39,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:39,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:39,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:40,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:40,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:40,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:40,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:40,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:40,850 INFO L193 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 [2019-01-20 10:06:40,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:40,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:40,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:42,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-20 10:06:44,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:44,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:06:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:06:44,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 10:06:44,449 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-20 10:06:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:47,200 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-20 10:06:47,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:06:47,201 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-20 10:06:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:47,202 INFO L225 Difference]: With dead ends: 525 [2019-01-20 10:06:47,202 INFO L226 Difference]: Without dead ends: 250 [2019-01-20 10:06:47,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:06:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-20 10:06:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-20 10:06:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-20 10:06:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-20 10:06:47,267 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-20 10:06:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:47,267 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-20 10:06:47,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:06:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-20 10:06:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-20 10:06:47,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:47,269 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-20 10:06:47,269 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-20 10:06:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:47,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:47,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:50,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:50,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:50,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:50,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:50,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:50,140 INFO L193 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 [2019-01-20 10:06:50,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:50,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:50,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-20 10:06:50,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:50,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:57,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:04,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:04,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-20 10:07:04,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:04,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-20 10:07:04,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-20 10:07:04,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:07:04,874 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-20 10:07:32,658 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-20 10:07:33,346 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-20 10:07:34,018 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-20 10:07:34,678 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-20 10:07:35,272 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:07:35,838 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:07:36,392 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:07:36,940 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:07:37,472 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:07:38,050 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:07:38,578 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:07:39,072 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:07:39,566 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:07:40,024 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:07:40,468 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:07:40,894 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:07:41,300 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:07:41,681 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:07:42,442 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-20 10:07:43,147 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-20 10:07:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:45,756 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-20 10:07:45,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-20 10:07:45,757 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-20 10:07:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:45,759 INFO L225 Difference]: With dead ends: 667 [2019-01-20 10:07:45,759 INFO L226 Difference]: Without dead ends: 388 [2019-01-20 10:07:45,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 49.1s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-20 10:07:45,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-20 10:07:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-20 10:07:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-20 10:07:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-20 10:07:45,823 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-20 10:07:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:45,823 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-20 10:07:45,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-20 10:07:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-20 10:07:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-20 10:07:45,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:45,824 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-20 10:07:45,824 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-20 10:07:45,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:45,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:45,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:48,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:48,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:48,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:48,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:48,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:48,916 INFO L193 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 [2019-01-20 10:07:48,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:48,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:48,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:48,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:48,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:52,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:52,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:52,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-20 10:07:52,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:52,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-20 10:07:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-20 10:07:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 10:07:52,322 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-20 10:08:06,382 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-20 10:08:06,980 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-20 10:08:07,573 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-20 10:08:07,985 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-20 10:08:08,384 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-20 10:08:08,848 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:08:09,223 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:08:09,617 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:08:09,987 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:08:10,349 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:08:10,704 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:08:11,047 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:08:11,382 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:08:11,716 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:08:12,031 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:08:12,334 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:08:12,624 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:08:12,906 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:08:13,185 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:08:14,009 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-20 10:08:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:16,225 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-20 10:08:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-20 10:08:16,225 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-20 10:08:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:16,226 INFO L225 Difference]: With dead ends: 544 [2019-01-20 10:08:16,226 INFO L226 Difference]: Without dead ends: 402 [2019-01-20 10:08:16,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-20 10:08:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-20 10:08:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-20 10:08:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-20 10:08:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-20 10:08:16,290 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-20 10:08:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:16,290 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-20 10:08:16,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-20 10:08:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-20 10:08:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-20 10:08:16,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:16,292 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-20 10:08:16,292 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-20 10:08:16,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:16,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:16,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:16,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:17,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:17,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:17,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:17,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:17,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:17,998 INFO L193 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 [2019-01-20 10:08:18,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:18,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:18,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:20,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:21,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:21,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-20 10:08:21,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:21,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-20 10:08:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-20 10:08:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 10:08:21,946 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-20 10:08:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:24,986 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-20 10:08:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:08:24,987 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-20 10:08:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:24,989 INFO L225 Difference]: With dead ends: 555 [2019-01-20 10:08:24,989 INFO L226 Difference]: Without dead ends: 264 [2019-01-20 10:08:24,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:08:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-20 10:08:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-20 10:08:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-20 10:08:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-20 10:08:25,052 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-20 10:08:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:25,052 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-20 10:08:25,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-20 10:08:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-20 10:08:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-20 10:08:25,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:25,053 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-20 10:08:25,053 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-20 10:08:25,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:25,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:25,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:25,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:25,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:28,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:28,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:28,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:28,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:28,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:28,087 INFO L193 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 [2019-01-20 10:08:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:08:28,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:08:28,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-20 10:08:28,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:28,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:36,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:44,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:44,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-20 10:08:44,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:44,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-20 10:08:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-20 10:08:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:08:44,413 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-20 10:09:15,837 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-20 10:09:16,579 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-20 10:09:17,332 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-20 10:09:18,009 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-20 10:09:18,677 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-20 10:09:19,306 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-20 10:09:19,931 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:09:20,609 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:09:21,198 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:09:21,771 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:09:22,335 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:09:22,916 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:09:23,439 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:09:23,941 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:09:24,444 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:09:24,927 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:09:25,389 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:09:25,905 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:09:26,339 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:09:26,758 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:09:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:31,172 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-20 10:09:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-20 10:09:31,172 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-20 10:09:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:31,174 INFO L225 Difference]: With dead ends: 705 [2019-01-20 10:09:31,174 INFO L226 Difference]: Without dead ends: 410 [2019-01-20 10:09:31,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-20 10:09:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-20 10:09:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-20 10:09:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-20 10:09:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-20 10:09:31,248 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-20 10:09:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:31,249 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-20 10:09:31,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-20 10:09:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-20 10:09:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-20 10:09:31,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:31,250 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-20 10:09:31,250 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:31,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:31,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-20 10:09:31,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:31,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:31,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:31,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:31,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:34,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:34,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:34,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:34,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:34,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:34,442 INFO L193 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 [2019-01-20 10:09:34,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:34,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:34,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:34,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:34,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:38,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:38,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:38,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-20 10:09:38,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:38,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-20 10:09:38,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-20 10:09:38,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 10:09:38,405 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-20 10:09:54,907 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-20 10:09:55,551 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-20 10:09:56,194 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-20 10:09:56,698 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-20 10:09:57,148 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-20 10:09:57,585 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-20 10:09:58,015 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-20 10:09:58,418 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:09:58,803 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:09:59,191 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:09:59,574 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:09:59,951 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:10:00,319 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:10:00,684 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:10:01,048 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:10:01,432 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:10:01,773 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:10:02,079 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:10:02,375 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:10:02,674 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:10:02,959 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:10:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:06,012 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-01-20 10:10:06,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-20 10:10:06,012 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-01-20 10:10:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:06,014 INFO L225 Difference]: With dead ends: 574 [2019-01-20 10:10:06,014 INFO L226 Difference]: Without dead ends: 424 [2019-01-20 10:10:06,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-01-20 10:10:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-20 10:10:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-01-20 10:10:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-20 10:10:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-01-20 10:10:06,098 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-01-20 10:10:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:06,098 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-01-20 10:10:06,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-20 10:10:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-01-20 10:10:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-20 10:10:06,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:06,099 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-20 10:10:06,099 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-01-20 10:10:06,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:06,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:10:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:06,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:08,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:08,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:08,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:08,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:08,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:08,222 INFO L193 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 [2019-01-20 10:10:08,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:08,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:08,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:10,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:12,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:12,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-01-20 10:10:12,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:12,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-20 10:10:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-20 10:10:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 10:10:12,924 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-01-20 10:10:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:16,234 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-01-20 10:10:16,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:10:16,235 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-01-20 10:10:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:16,237 INFO L225 Difference]: With dead ends: 585 [2019-01-20 10:10:16,237 INFO L226 Difference]: Without dead ends: 278 [2019-01-20 10:10:16,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:10:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-20 10:10:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-01-20 10:10:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-20 10:10:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-01-20 10:10:16,315 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-01-20 10:10:16,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:16,315 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-01-20 10:10:16,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-20 10:10:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-01-20 10:10:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-20 10:10:16,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:16,317 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-20 10:10:16,317 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:16,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-01-20 10:10:16,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:16,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:16,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:19,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:19,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:19,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:19,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:19,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:19,918 INFO L193 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 [2019-01-20 10:10:19,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:10:19,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:10:20,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-20 10:10:20,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:20,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:29,335 INFO L316 TraceCheckSpWp]: Computing backward predicates...