java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:34:17,061 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:34:17,063 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:34:17,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:34:17,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:34:17,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:34:17,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:34:17,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:34:17,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:34:17,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:34:17,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:34:17,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:34:17,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:34:17,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:34:17,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:34:17,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:34:17,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:34:17,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:34:17,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:34:17,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:34:17,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:34:17,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:34:17,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:34:17,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:34:17,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:34:17,104 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:34:17,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:34:17,106 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:34:17,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:34:17,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:34:17,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:34:17,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:34:17,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:34:17,110 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:34:17,111 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:34:17,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:34:17,112 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:34:17,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:34:17,132 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:34:17,133 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:34:17,133 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:34:17,133 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:34:17,134 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:34:17,134 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:34:17,135 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:34:17,135 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:34:17,135 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:34:17,135 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:34:17,136 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:34:17,136 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:34:17,136 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:34:17,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:34:17,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:34:17,138 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:34:17,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:34:17,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:34:17,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:34:17,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:34:17,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:34:17,140 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:34:17,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:34:17,141 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:34:17,141 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:34:17,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:34:17,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:34:17,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:34:17,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:34:17,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:34:17,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:34:17,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:34:17,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:34:17,143 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:34:17,143 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:34:17,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:34:17,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:34:17,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:34:17,144 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:34:17,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:34:17,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:34:17,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:34:17,194 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:34:17,195 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:34:17,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl [2018-12-03 19:34:17,195 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl' [2018-12-03 19:34:17,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:34:17,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:34:17,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:34:17,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:34:17,225 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:34:17,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,259 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 19:34:17,260 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 19:34:17,260 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 19:34:17,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:34:17,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:34:17,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:34:17,263 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:34:17,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... [2018-12-03 19:34:17,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:34:17,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:34:17,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:34:17,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:34:17,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:34:17,355 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 19:34:17,355 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 19:34:17,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 19:34:17,529 INFO L272 CfgBuilder]: Using library mode [2018-12-03 19:34:17,529 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 19:34:17,530 INFO L202 PluginConnector]: Adding new model MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:34:17 BoogieIcfgContainer [2018-12-03 19:34:17,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:34:17,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:34:17,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:34:17,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:34:17,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:17" (1/2) ... [2018-12-03 19:34:17,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9d5639 and model type MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:34:17, skipping insertion in model container [2018-12-03 19:34:17,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:34:17" (2/2) ... [2018-12-03 19:34:17,539 INFO L112 eAbstractionObserver]: Analyzing ICFG MonadicInvariant01.bpl [2018-12-03 19:34:17,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:34:17,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:34:17,576 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:34:17,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:34:17,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:34:17,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:34:17,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:34:17,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:34:17,612 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:34:17,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:34:17,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:34:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 19:34:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 19:34:17,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:17,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 19:34:17,638 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:17,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-03 19:34:17,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:17,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:17,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:17,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:17,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:17,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:34:17,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 19:34:17,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:34:17,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:34:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:34:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:34:17,810 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 19:34:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:17,906 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 19:34:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:34:17,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 19:34:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:17,926 INFO L225 Difference]: With dead ends: 11 [2018-12-03 19:34:17,926 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 19:34:17,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:34:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 19:34:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 19:34:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 19:34:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 19:34:18,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-03 19:34:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:18,007 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 19:34:18,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:34:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 19:34:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 19:34:18,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:18,009 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 19:34:18,009 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:18,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-03 19:34:18,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:18,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:18,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:18,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:18,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:18,110 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 19:34:18,112 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-03 19:34:18,170 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:34:18,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:34:18,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:34:18,402 INFO L272 AbstractInterpreter]: Visited 4 different actions 37 times. Merged at 2 different actions 22 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 19:34:18,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:18,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:34:18,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:18,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:18,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:18,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:18,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:18,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:18,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:18,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-03 19:34:18,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:18,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 19:34:18,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 19:34:18,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:34:18,660 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 19:34:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:18,705 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 19:34:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 19:34:18,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 19:34:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:18,706 INFO L225 Difference]: With dead ends: 9 [2018-12-03 19:34:18,706 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 19:34:18,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:34:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 19:34:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 19:34:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 19:34:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 19:34:18,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-03 19:34:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:18,711 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 19:34:18,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 19:34:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 19:34:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 19:34:18,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:18,712 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-03 19:34:18,712 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:18,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-03 19:34:18,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:18,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:18,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:18,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:18,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:18,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:18,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:18,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:18,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:18,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:18,814 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:18,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 19:34:18,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:18,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:19,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:19,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:19,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-03 19:34:19,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:19,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 19:34:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 19:34:19,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 19:34:19,314 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 19:34:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:19,361 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 19:34:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:34:19,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 19:34:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:19,365 INFO L225 Difference]: With dead ends: 11 [2018-12-03 19:34:19,365 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 19:34:19,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 19:34:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 19:34:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 19:34:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 19:34:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 19:34:19,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-03 19:34:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:19,371 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 19:34:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 19:34:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 19:34:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 19:34:19,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:19,372 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-03 19:34:19,372 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:19,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:19,373 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-03 19:34:19,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:19,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:19,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:19,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:19,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:19,460 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:19,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:19,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:19,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:19,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:19,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:19,483 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:19,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:19,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:19,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:19,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:19,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-03 19:34:19,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:19,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 19:34:19,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 19:34:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 19:34:19,775 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 19:34:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:19,834 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 19:34:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 19:34:19,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 19:34:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:19,837 INFO L225 Difference]: With dead ends: 13 [2018-12-03 19:34:19,837 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 19:34:19,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 19:34:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 19:34:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 19:34:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 19:34:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 19:34:19,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-03 19:34:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:19,842 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 19:34:19,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 19:34:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 19:34:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 19:34:19,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:19,843 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-03 19:34:19,843 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:19,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:19,844 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-03 19:34:19,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:19,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:19,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:19,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:19,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:19,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:19,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:19,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:19,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:19,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:19,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:19,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:20,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:20,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:20,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-03 19:34:20,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:20,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 19:34:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 19:34:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 19:34:20,683 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 19:34:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:20,754 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 19:34:20,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 19:34:20,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 19:34:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:20,755 INFO L225 Difference]: With dead ends: 15 [2018-12-03 19:34:20,756 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 19:34:20,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 19:34:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 19:34:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 19:34:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 19:34:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 19:34:20,760 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-03 19:34:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:20,760 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 19:34:20,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 19:34:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 19:34:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 19:34:20,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:20,762 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-03 19:34:20,762 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:20,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:20,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-03 19:34:20,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:20,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:20,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:20,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:20,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:20,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:20,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:20,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:20,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:20,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:20,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:20,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:20,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:20,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 19:34:20,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:20,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:21,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:21,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:21,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-03 19:34:21,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:21,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 19:34:21,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 19:34:21,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:34:21,170 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 19:34:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:21,252 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 19:34:21,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 19:34:21,253 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 19:34:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:21,254 INFO L225 Difference]: With dead ends: 17 [2018-12-03 19:34:21,254 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 19:34:21,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:34:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 19:34:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 19:34:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 19:34:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 19:34:21,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-03 19:34:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:21,259 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 19:34:21,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 19:34:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 19:34:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:34:21,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:21,260 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-03 19:34:21,260 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:21,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-03 19:34:21,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:21,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:21,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:21,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:21,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:21,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:21,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:21,373 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:21,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:21,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:21,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:21,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:21,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:21,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:21,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:21,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:21,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:21,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:21,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 19:34:21,691 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:21,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 19:34:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 19:34:21,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 19:34:21,693 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 19:34:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:21,780 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 19:34:21,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 19:34:21,780 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 19:34:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:21,781 INFO L225 Difference]: With dead ends: 19 [2018-12-03 19:34:21,781 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 19:34:21,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 19:34:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 19:34:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 19:34:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 19:34:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 19:34:21,787 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-03 19:34:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:21,787 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 19:34:21,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 19:34:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 19:34:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 19:34:21,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:21,788 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-03 19:34:21,788 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-03 19:34:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:21,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:21,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:21,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:21,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:21,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:21,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:21,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:21,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:21,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:21,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:21,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:22,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:22,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:22,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-03 19:34:22,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:22,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 19:34:22,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 19:34:22,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 19:34:22,306 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 19:34:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:22,380 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 19:34:22,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 19:34:22,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 19:34:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:22,381 INFO L225 Difference]: With dead ends: 21 [2018-12-03 19:34:22,381 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 19:34:22,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 19:34:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 19:34:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 19:34:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 19:34:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 19:34:22,387 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-03 19:34:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:22,387 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 19:34:22,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 19:34:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 19:34:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:34:22,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:22,388 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-03 19:34:22,388 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:22,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:22,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-03 19:34:22,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:22,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:22,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:22,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:22,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:22,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:22,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:22,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:22,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:22,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:22,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:22,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:22,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 19:34:22,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:22,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:22,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:22,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:22,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-03 19:34:22,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:22,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 19:34:22,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 19:34:22,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 19:34:22,982 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 19:34:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:23,048 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 19:34:23,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 19:34:23,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 19:34:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:23,050 INFO L225 Difference]: With dead ends: 23 [2018-12-03 19:34:23,051 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 19:34:23,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 19:34:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 19:34:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 19:34:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 19:34:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 19:34:23,055 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-03 19:34:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:23,056 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 19:34:23,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 19:34:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 19:34:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 19:34:23,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:23,057 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-03 19:34:23,057 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:23,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-03 19:34:23,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:23,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:23,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:23,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:23,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:23,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:23,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:23,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:23,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:23,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:23,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:23,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:23,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:23,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:23,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:23,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:23,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:23,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-03 19:34:23,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:23,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 19:34:23,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 19:34:23,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 19:34:23,927 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 19:34:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:24,233 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 19:34:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 19:34:24,234 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 19:34:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:24,235 INFO L225 Difference]: With dead ends: 25 [2018-12-03 19:34:24,235 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 19:34:24,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 19:34:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 19:34:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 19:34:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 19:34:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 19:34:24,245 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-03 19:34:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:24,246 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 19:34:24,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 19:34:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 19:34:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 19:34:24,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:24,247 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-03 19:34:24,248 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:24,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:24,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-03 19:34:24,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:24,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:24,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:24,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:24,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:24,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:24,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:24,508 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:24,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:24,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:24,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:24,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:24,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:24,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:24,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:25,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:25,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-03 19:34:25,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:25,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 19:34:25,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 19:34:25,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 19:34:25,295 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 19:34:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:25,656 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 19:34:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 19:34:25,657 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 19:34:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:25,658 INFO L225 Difference]: With dead ends: 27 [2018-12-03 19:34:25,658 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 19:34:25,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 19:34:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 19:34:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 19:34:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 19:34:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 19:34:25,666 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-03 19:34:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:25,666 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 19:34:25,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 19:34:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 19:34:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 19:34:25,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:25,668 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-03 19:34:25,668 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:25,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-03 19:34:25,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:25,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:25,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:25,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:25,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:25,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:25,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:25,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:25,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:25,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:25,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:25,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 19:34:25,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:25,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:26,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:26,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:26,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-03 19:34:26,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:26,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 19:34:26,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 19:34:26,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 19:34:26,822 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 19:34:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:26,891 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 19:34:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 19:34:26,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 19:34:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:26,892 INFO L225 Difference]: With dead ends: 29 [2018-12-03 19:34:26,892 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 19:34:26,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 19:34:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 19:34:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 19:34:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 19:34:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 19:34:26,898 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-03 19:34:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:26,898 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 19:34:26,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 19:34:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 19:34:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 19:34:26,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:26,899 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-03 19:34:26,900 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:26,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-03 19:34:26,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:26,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:26,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:27,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:27,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:27,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:27,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:27,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:27,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:27,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:27,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:27,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:27,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:27,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:27,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:27,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:27,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-03 19:34:27,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:27,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 19:34:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 19:34:27,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 19:34:27,898 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 19:34:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:27,985 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 19:34:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 19:34:27,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 19:34:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:27,987 INFO L225 Difference]: With dead ends: 31 [2018-12-03 19:34:27,987 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 19:34:27,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 19:34:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 19:34:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 19:34:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 19:34:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 19:34:27,993 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-03 19:34:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:27,994 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 19:34:27,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 19:34:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 19:34:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 19:34:27,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:27,995 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-03 19:34:27,995 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:27,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:27,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-03 19:34:27,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:27,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:27,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:27,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:27,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:28,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:28,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:28,243 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:28,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:28,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:28,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:28,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:28,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:28,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:28,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:29,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:29,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-03 19:34:29,438 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:29,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 19:34:29,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 19:34:29,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 19:34:29,440 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 19:34:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:29,509 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 19:34:29,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 19:34:29,509 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 19:34:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:29,510 INFO L225 Difference]: With dead ends: 33 [2018-12-03 19:34:29,511 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 19:34:29,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 19:34:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 19:34:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 19:34:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 19:34:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 19:34:29,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-03 19:34:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:29,518 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 19:34:29,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 19:34:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 19:34:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 19:34:29,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:29,519 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-03 19:34:29,519 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:29,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-03 19:34:29,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:29,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:29,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:29,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:29,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:29,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:29,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:29,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:29,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:29,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:29,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:29,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:29,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:29,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 19:34:29,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:29,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:30,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:31,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:31,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-03 19:34:31,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:31,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 19:34:31,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 19:34:31,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 19:34:31,284 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 19:34:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:31,467 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 19:34:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 19:34:31,468 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 19:34:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:31,469 INFO L225 Difference]: With dead ends: 35 [2018-12-03 19:34:31,470 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 19:34:31,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 19:34:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 19:34:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 19:34:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 19:34:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 19:34:31,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-03 19:34:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:31,477 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 19:34:31,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 19:34:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 19:34:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 19:34:31,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:31,478 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-03 19:34:31,478 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:31,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-03 19:34:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:31,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:31,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:31,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:31,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:31,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:31,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:31,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:31,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:31,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:31,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:31,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:31,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:31,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:31,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:32,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:32,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:32,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-03 19:34:32,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:32,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 19:34:32,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 19:34:32,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 19:34:32,832 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 19:34:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:32,983 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 19:34:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 19:34:32,984 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 19:34:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:32,985 INFO L225 Difference]: With dead ends: 37 [2018-12-03 19:34:32,985 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 19:34:32,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 19:34:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 19:34:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 19:34:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 19:34:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 19:34:32,992 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-03 19:34:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:32,992 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 19:34:32,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 19:34:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 19:34:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 19:34:32,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:32,993 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-03 19:34:32,993 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:32,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-03 19:34:32,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:32,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:32,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:33,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:33,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:33,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:33,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:33,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:33,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:33,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:33,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:33,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:33,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:34,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:34,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-03 19:34:34,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:34,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 19:34:34,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 19:34:34,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 19:34:34,129 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 19:34:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:34,207 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 19:34:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 19:34:34,208 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 19:34:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:34,209 INFO L225 Difference]: With dead ends: 39 [2018-12-03 19:34:34,209 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 19:34:34,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 19:34:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 19:34:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 19:34:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 19:34:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 19:34:34,215 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 19:34:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:34,216 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 19:34:34,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 19:34:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 19:34:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 19:34:34,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:34,217 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-03 19:34:34,217 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:34,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-03 19:34:34,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:34,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:34,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:34,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:34,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:34,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:34,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:34,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:34,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:34,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:34,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:34,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 19:34:34,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:34,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:34,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:35,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:35,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-03 19:34:35,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:35,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 19:34:35,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 19:34:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 19:34:35,445 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 19:34:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:35,721 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 19:34:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 19:34:35,721 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 19:34:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:35,722 INFO L225 Difference]: With dead ends: 41 [2018-12-03 19:34:35,722 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 19:34:35,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 19:34:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 19:34:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 19:34:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 19:34:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 19:34:35,729 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 19:34:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:35,730 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 19:34:35,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 19:34:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 19:34:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 19:34:35,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:35,731 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-03 19:34:35,731 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:35,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-03 19:34:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:35,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:35,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:35,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:35,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:36,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:36,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:36,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:36,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:36,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:36,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:36,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:36,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:36,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:36,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:36,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:36,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:37,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:37,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-03 19:34:37,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:37,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 19:34:37,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 19:34:37,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 19:34:37,286 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 19:34:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:37,489 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 19:34:37,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 19:34:37,489 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 19:34:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:37,490 INFO L225 Difference]: With dead ends: 43 [2018-12-03 19:34:37,490 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 19:34:37,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 19:34:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 19:34:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 19:34:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 19:34:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 19:34:37,496 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 19:34:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:37,497 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 19:34:37,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 19:34:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 19:34:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 19:34:37,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:37,498 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-03 19:34:37,498 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:37,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-03 19:34:37,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:37,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:37,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:37,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:37,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:37,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:37,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:37,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:37,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:37,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:37,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:37,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:37,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:37,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:38,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:38,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:38,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-03 19:34:38,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:38,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 19:34:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 19:34:38,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:34:38,937 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 19:34:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:39,030 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 19:34:39,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 19:34:39,030 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 19:34:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:39,031 INFO L225 Difference]: With dead ends: 45 [2018-12-03 19:34:39,031 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 19:34:39,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:34:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 19:34:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 19:34:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 19:34:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 19:34:39,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 19:34:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:39,038 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 19:34:39,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 19:34:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 19:34:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 19:34:39,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:39,039 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-03 19:34:39,040 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:39,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:39,040 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-03 19:34:39,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:39,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:39,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:39,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:39,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:39,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:39,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:39,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:39,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:39,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:39,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:39,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:39,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:39,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 19:34:39,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:39,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:39,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:40,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:40,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-03 19:34:40,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:40,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 19:34:40,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 19:34:40,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 19:34:40,567 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-12-03 19:34:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:40,668 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 19:34:40,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 19:34:40,669 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-12-03 19:34:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:40,670 INFO L225 Difference]: With dead ends: 47 [2018-12-03 19:34:40,670 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 19:34:40,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 19:34:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 19:34:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 19:34:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 19:34:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 19:34:40,677 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-03 19:34:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:40,678 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 19:34:40,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 19:34:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 19:34:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 19:34:40,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:40,679 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-03 19:34:40,679 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:40,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-03 19:34:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:40,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:40,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:41,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:41,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:41,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:41,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:41,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:41,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:41,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:41,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:41,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:41,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:41,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:42,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:42,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:42,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-03 19:34:42,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:42,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 19:34:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 19:34:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 19:34:42,689 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-12-03 19:34:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:42,803 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 19:34:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 19:34:42,806 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-12-03 19:34:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:42,807 INFO L225 Difference]: With dead ends: 49 [2018-12-03 19:34:42,807 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 19:34:42,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 19:34:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 19:34:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 19:34:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 19:34:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 19:34:42,812 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-03 19:34:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:42,812 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 19:34:42,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 19:34:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 19:34:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 19:34:42,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:42,813 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-03 19:34:42,813 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:42,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-03 19:34:42,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:42,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:42,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:42,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:42,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:43,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:43,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:43,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:43,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:43,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:43,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:43,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:43,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:43,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:44,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:44,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:44,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-03 19:34:44,782 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:44,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 19:34:44,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 19:34:44,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 19:34:44,784 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-12-03 19:34:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:44,890 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 19:34:44,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 19:34:44,890 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-12-03 19:34:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:44,891 INFO L225 Difference]: With dead ends: 51 [2018-12-03 19:34:44,891 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 19:34:44,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 19:34:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 19:34:44,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 19:34:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 19:34:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 19:34:44,898 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-03 19:34:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:44,898 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 19:34:44,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 19:34:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 19:34:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 19:34:44,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:44,899 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-03 19:34:44,899 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:44,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-03 19:34:44,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:44,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:44,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:44,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:45,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:45,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:45,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:45,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:45,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:45,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:45,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:45,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:45,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 19:34:45,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:45,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:45,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:46,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:46,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-03 19:34:46,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:46,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 19:34:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 19:34:46,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 19:34:46,645 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-12-03 19:34:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:46,918 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 19:34:46,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 19:34:46,919 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-12-03 19:34:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:46,919 INFO L225 Difference]: With dead ends: 53 [2018-12-03 19:34:46,920 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 19:34:46,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 19:34:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 19:34:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 19:34:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 19:34:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 19:34:46,926 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-03 19:34:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:46,926 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 19:34:46,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 19:34:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 19:34:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 19:34:46,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:46,927 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-03 19:34:46,927 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:46,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-03 19:34:46,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:46,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:46,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:46,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:47,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:47,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:47,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:47,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:47,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:47,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:47,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:47,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:47,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:47,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:47,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:47,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:48,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:48,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-03 19:34:48,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:48,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 19:34:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 19:34:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 19:34:48,561 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-12-03 19:34:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:48,695 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 19:34:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 19:34:48,695 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-03 19:34:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:48,696 INFO L225 Difference]: With dead ends: 55 [2018-12-03 19:34:48,696 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 19:34:48,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 19:34:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 19:34:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 19:34:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 19:34:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 19:34:48,703 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-03 19:34:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:48,703 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 19:34:48,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 19:34:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 19:34:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 19:34:48,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:48,704 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-03 19:34:48,704 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:48,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-03 19:34:48,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:48,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:48,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:49,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:49,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:49,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:49,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:49,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:49,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:49,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:49,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:49,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:49,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:51,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:51,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-03 19:34:51,179 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:51,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 19:34:51,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 19:34:51,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 19:34:51,180 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-12-03 19:34:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:51,358 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 19:34:51,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 19:34:51,358 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-12-03 19:34:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:51,359 INFO L225 Difference]: With dead ends: 57 [2018-12-03 19:34:51,359 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 19:34:51,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 19:34:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 19:34:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 19:34:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 19:34:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 19:34:51,364 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-03 19:34:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:51,365 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 19:34:51,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 19:34:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 19:34:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 19:34:51,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:51,366 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-03 19:34:51,366 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:51,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-03 19:34:51,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:51,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:51,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:51,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:51,817 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:51,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:51,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:51,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:51,826 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:51,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 19:34:51,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:51,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:52,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:53,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:53,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-03 19:34:53,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 19:34:53,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 19:34:53,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 19:34:53,263 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-12-03 19:34:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:53,379 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 19:34:53,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 19:34:53,380 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-12-03 19:34:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:53,381 INFO L225 Difference]: With dead ends: 59 [2018-12-03 19:34:53,381 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 19:34:53,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 19:34:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 19:34:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 19:34:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 19:34:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 19:34:53,384 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-03 19:34:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:53,385 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 19:34:53,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 19:34:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 19:34:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 19:34:53,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:53,385 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-03 19:34:53,385 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:53,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:53,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-03 19:34:53,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:53,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:53,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:53,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:53,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:53,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:53,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:53,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:53,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:53,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:53,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:53,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:53,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:54,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:54,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:54,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:54,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:55,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-03 19:34:55,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:55,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 19:34:55,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 19:34:55,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 19:34:55,785 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-12-03 19:34:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:55,935 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 19:34:55,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 19:34:55,936 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-12-03 19:34:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:55,937 INFO L225 Difference]: With dead ends: 61 [2018-12-03 19:34:55,937 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 19:34:55,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 19:34:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 19:34:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 19:34:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 19:34:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 19:34:55,941 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-03 19:34:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:55,942 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 19:34:55,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 19:34:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 19:34:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 19:34:55,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:55,943 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-03 19:34:55,943 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:55,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-03 19:34:55,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:55,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:55,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:55,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:55,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:56,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:56,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:56,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:56,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:56,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:56,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:56,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:56,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:56,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:57,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:58,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:58,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-03 19:34:58,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:58,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 19:34:58,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 19:34:58,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 19:34:58,060 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-12-03 19:34:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:58,268 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 19:34:58,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 19:34:58,268 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-12-03 19:34:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:58,269 INFO L225 Difference]: With dead ends: 63 [2018-12-03 19:34:58,269 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 19:34:58,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 19:34:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 19:34:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 19:34:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 19:34:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 19:34:58,274 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-03 19:34:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:58,274 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 19:34:58,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 19:34:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 19:34:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 19:34:58,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:58,275 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-03 19:34:58,275 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:58,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-03 19:34:58,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:58,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:58,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:58,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:58,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:58,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:58,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:58,779 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:58,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:58,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:58,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:58,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:58,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 19:34:58,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:58,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:59,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:00,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:00,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-03 19:35:00,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:00,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 19:35:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 19:35:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 19:35:00,879 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-12-03 19:35:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:01,053 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 19:35:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 19:35:01,053 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-12-03 19:35:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:01,054 INFO L225 Difference]: With dead ends: 65 [2018-12-03 19:35:01,054 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 19:35:01,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 19:35:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 19:35:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 19:35:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 19:35:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 19:35:01,059 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-03 19:35:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:01,060 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 19:35:01,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 19:35:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 19:35:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 19:35:01,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:01,060 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-03 19:35:01,061 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:01,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-03 19:35:01,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:01,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:01,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:01,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:01,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:02,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:02,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:02,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:02,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:02,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:02,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:02,428 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:02,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:02,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:02,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:03,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:04,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:04,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-03 19:35:04,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:04,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 19:35:04,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 19:35:04,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 19:35:04,183 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-12-03 19:35:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:04,316 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 19:35:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 19:35:04,316 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-12-03 19:35:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:04,317 INFO L225 Difference]: With dead ends: 67 [2018-12-03 19:35:04,317 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 19:35:04,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 19:35:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 19:35:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 19:35:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 19:35:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 19:35:04,323 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-03 19:35:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:04,323 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 19:35:04,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 19:35:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 19:35:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 19:35:04,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:04,323 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-03 19:35:04,324 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:04,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-03 19:35:04,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:04,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:04,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:04,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:04,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:04,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:04,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:04,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:04,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:04,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:04,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:04,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:05,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:07,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:07,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-03 19:35:07,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:07,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 19:35:07,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 19:35:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 19:35:07,137 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-12-03 19:35:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:07,323 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 19:35:07,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 19:35:07,324 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-12-03 19:35:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:07,325 INFO L225 Difference]: With dead ends: 69 [2018-12-03 19:35:07,325 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 19:35:07,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 19:35:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 19:35:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 19:35:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 19:35:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 19:35:07,332 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-03 19:35:07,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:07,332 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 19:35:07,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 19:35:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 19:35:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 19:35:07,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:07,333 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-03 19:35:07,333 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:07,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-03 19:35:07,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:07,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:07,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:07,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:08,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:08,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:08,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:08,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:08,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:08,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:08,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:08,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:08,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 19:35:08,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:08,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:08,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:10,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:10,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-03 19:35:10,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:10,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 19:35:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 19:35:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 19:35:10,326 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-12-03 19:35:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:10,472 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 19:35:10,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 19:35:10,473 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-12-03 19:35:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:10,473 INFO L225 Difference]: With dead ends: 71 [2018-12-03 19:35:10,474 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 19:35:10,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 19:35:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 19:35:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 19:35:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 19:35:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 19:35:10,478 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-03 19:35:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:10,478 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 19:35:10,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 19:35:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 19:35:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 19:35:10,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:10,479 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-03 19:35:10,479 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:10,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-03 19:35:10,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:10,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:10,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:10,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:10,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:11,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:11,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:11,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:11,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:11,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:11,309 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:11,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:11,317 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:11,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:11,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:11,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:12,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:13,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:13,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-03 19:35:13,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:13,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 19:35:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 19:35:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 19:35:13,638 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-12-03 19:35:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:13,823 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 19:35:13,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 19:35:13,823 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-12-03 19:35:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:13,824 INFO L225 Difference]: With dead ends: 73 [2018-12-03 19:35:13,824 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 19:35:13,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 19:35:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 19:35:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 19:35:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 19:35:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 19:35:13,829 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-03 19:35:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:13,829 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 19:35:13,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 19:35:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 19:35:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 19:35:13,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:13,830 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-03 19:35:13,830 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:13,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-03 19:35:13,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:13,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:13,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:14,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:14,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:14,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:14,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:14,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:14,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:14,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:14,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:14,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:15,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:17,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:17,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-03 19:35:17,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:17,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 19:35:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 19:35:17,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 19:35:17,364 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-12-03 19:35:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:17,511 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 19:35:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 19:35:17,512 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-12-03 19:35:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:17,513 INFO L225 Difference]: With dead ends: 75 [2018-12-03 19:35:17,513 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 19:35:17,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 19:35:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 19:35:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 19:35:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 19:35:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 19:35:17,519 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-03 19:35:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:17,519 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 19:35:17,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 19:35:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 19:35:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 19:35:17,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:17,520 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-03 19:35:17,520 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:17,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-03 19:35:17,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:17,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:17,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:18,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:18,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:18,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:18,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:18,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:18,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:18,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:18,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:18,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 19:35:18,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:18,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:19,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:20,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:20,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-03 19:35:20,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:20,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 19:35:20,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 19:35:20,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 19:35:20,785 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-12-03 19:35:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:21,126 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 19:35:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 19:35:21,127 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-12-03 19:35:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:21,127 INFO L225 Difference]: With dead ends: 77 [2018-12-03 19:35:21,127 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 19:35:21,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 19:35:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 19:35:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 19:35:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 19:35:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 19:35:21,133 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-03 19:35:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:21,133 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 19:35:21,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 19:35:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 19:35:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 19:35:21,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:21,134 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-03 19:35:21,134 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:21,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-03 19:35:21,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:21,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:21,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:21,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:21,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:21,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:21,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:21,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:21,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:21,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:21,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:21,913 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:21,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:21,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:21,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:22,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:24,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:24,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-03 19:35:24,432 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:24,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 19:35:24,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 19:35:24,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 19:35:24,434 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-12-03 19:35:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:24,591 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 19:35:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 19:35:24,592 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-12-03 19:35:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:24,592 INFO L225 Difference]: With dead ends: 79 [2018-12-03 19:35:24,593 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 19:35:24,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 19:35:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 19:35:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 19:35:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 19:35:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 19:35:24,598 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-03 19:35:24,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:24,598 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 19:35:24,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 19:35:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 19:35:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 19:35:24,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:24,599 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-03 19:35:24,599 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:24,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:24,600 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-03 19:35:24,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:24,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:24,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:24,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:24,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:25,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:25,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:25,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:25,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:25,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:25,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:25,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:25,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:25,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:26,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:28,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-03 19:35:28,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:28,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 19:35:28,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 19:35:28,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 19:35:28,406 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-12-03 19:35:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:28,571 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 19:35:28,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 19:35:28,571 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-12-03 19:35:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:28,572 INFO L225 Difference]: With dead ends: 81 [2018-12-03 19:35:28,572 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 19:35:28,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 19:35:28,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 19:35:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 19:35:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 19:35:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 19:35:28,577 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-03 19:35:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:28,577 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 19:35:28,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 19:35:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 19:35:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 19:35:28,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:28,578 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-03 19:35:28,578 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:28,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:28,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-03 19:35:28,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:28,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:28,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:28,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:28,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:29,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:29,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:29,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:29,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:29,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:29,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:29,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:29,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:29,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 19:35:29,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:29,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:30,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:32,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:32,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-03 19:35:32,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:32,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 19:35:32,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 19:35:32,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 19:35:32,604 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-12-03 19:35:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:32,812 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 19:35:32,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 19:35:32,812 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-12-03 19:35:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:32,813 INFO L225 Difference]: With dead ends: 83 [2018-12-03 19:35:32,813 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 19:35:32,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 19:35:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 19:35:32,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 19:35:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 19:35:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 19:35:32,818 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-03 19:35:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:32,818 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 19:35:32,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 19:35:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 19:35:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 19:35:32,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:32,819 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-03 19:35:32,819 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:32,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-03 19:35:32,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:32,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:32,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:32,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:32,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:33,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:33,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:33,669 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:33,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:33,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:33,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:33,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:33,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:33,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:33,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:33,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:34,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:36,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:36,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-03 19:35:36,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:36,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 19:35:36,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 19:35:36,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 19:35:36,868 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-12-03 19:35:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:37,033 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 19:35:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 19:35:37,033 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-12-03 19:35:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:37,034 INFO L225 Difference]: With dead ends: 85 [2018-12-03 19:35:37,034 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 19:35:37,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 19:35:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 19:35:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 19:35:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 19:35:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 19:35:37,039 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-03 19:35:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:37,039 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 19:35:37,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 19:35:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 19:35:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 19:35:37,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:37,040 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-03 19:35:37,040 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:37,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-03 19:35:37,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:37,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:37,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:37,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:37,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:37,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:37,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:37,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:37,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:37,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:37,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:37,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:38,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:41,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:41,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-03 19:35:41,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:41,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 19:35:41,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 19:35:41,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 19:35:41,065 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-12-03 19:35:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:41,308 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 19:35:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 19:35:41,309 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-12-03 19:35:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:41,310 INFO L225 Difference]: With dead ends: 87 [2018-12-03 19:35:41,310 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 19:35:41,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 19:35:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 19:35:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 19:35:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 19:35:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 19:35:41,317 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-03 19:35:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:41,318 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 19:35:41,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 19:35:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 19:35:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 19:35:41,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:41,319 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-03 19:35:41,319 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:41,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-03 19:35:41,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:41,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:41,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:41,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:41,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:42,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:42,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:42,391 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:42,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:42,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:42,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:42,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:42,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:42,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 19:35:42,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:42,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:43,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:45,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:45,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-03 19:35:45,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:45,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 19:35:45,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 19:35:45,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 19:35:45,684 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-12-03 19:35:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:45,887 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 19:35:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 19:35:45,887 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-12-03 19:35:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:45,888 INFO L225 Difference]: With dead ends: 89 [2018-12-03 19:35:45,888 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 19:35:45,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 19:35:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 19:35:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 19:35:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 19:35:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 19:35:45,894 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-03 19:35:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:45,894 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 19:35:45,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 19:35:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 19:35:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 19:35:45,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:45,895 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-03 19:35:45,895 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:45,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-03 19:35:45,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:45,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:45,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:47,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:47,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:47,055 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:47,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:47,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:47,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:47,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:47,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:47,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:47,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:47,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:48,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:50,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:50,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-03 19:35:50,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:50,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 19:35:50,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 19:35:50,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 19:35:50,489 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-12-03 19:35:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:50,726 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 19:35:50,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 19:35:50,726 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-12-03 19:35:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:50,727 INFO L225 Difference]: With dead ends: 91 [2018-12-03 19:35:50,727 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 19:35:50,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 19:35:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 19:35:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 19:35:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 19:35:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 19:35:50,733 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-03 19:35:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:50,733 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 19:35:50,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 19:35:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 19:35:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 19:35:50,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:50,734 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-03 19:35:50,734 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:50,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-03 19:35:50,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:50,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:50,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:50,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:52,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:52,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:52,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:52,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:52,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:52,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:52,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:52,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:52,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:53,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:56,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:56,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-03 19:35:56,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:56,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 19:35:56,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 19:35:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 19:35:56,146 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-12-03 19:35:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:56,417 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 19:35:56,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 19:35:56,417 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-12-03 19:35:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:56,418 INFO L225 Difference]: With dead ends: 93 [2018-12-03 19:35:56,419 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 19:35:56,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 19:35:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 19:35:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 19:35:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 19:35:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 19:35:56,423 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-03 19:35:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:56,423 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 19:35:56,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 19:35:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 19:35:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 19:35:56,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:56,424 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-03 19:35:56,425 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:56,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-03 19:35:56,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:56,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:56,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:56,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:56,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:57,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:57,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:57,799 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:57,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:57,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:57,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:57,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:57,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:57,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 19:35:57,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:57,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:59,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:01,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:01,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-03 19:36:01,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:01,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 19:36:01,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 19:36:01,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 19:36:01,534 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-12-03 19:36:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:01,744 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 19:36:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 19:36:01,744 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-12-03 19:36:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:01,745 INFO L225 Difference]: With dead ends: 95 [2018-12-03 19:36:01,746 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 19:36:01,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 19:36:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 19:36:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 19:36:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 19:36:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 19:36:01,750 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-03 19:36:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:01,751 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 19:36:01,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 19:36:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 19:36:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 19:36:01,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:01,751 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-03 19:36:01,751 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:01,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-03 19:36:01,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:01,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:01,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:03,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:03,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:03,069 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:03,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:03,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:03,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:03,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:03,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:03,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:03,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:03,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:04,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:07,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:07,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-03 19:36:07,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:07,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 19:36:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 19:36:07,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 19:36:07,202 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-12-03 19:36:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:07,482 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 19:36:07,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 19:36:07,483 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-12-03 19:36:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:07,484 INFO L225 Difference]: With dead ends: 97 [2018-12-03 19:36:07,484 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 19:36:07,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 19:36:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 19:36:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 19:36:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 19:36:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 19:36:07,490 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-03 19:36:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:07,490 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 19:36:07,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 19:36:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 19:36:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 19:36:07,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:07,491 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-03 19:36:07,491 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:07,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-03 19:36:07,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:07,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:07,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:08,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:08,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:08,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:08,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:08,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:08,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:08,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:08,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:08,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:09,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:12,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:12,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-03 19:36:12,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:12,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 19:36:12,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 19:36:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 19:36:12,823 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-12-03 19:36:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:13,037 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 19:36:13,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 19:36:13,038 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-12-03 19:36:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:13,039 INFO L225 Difference]: With dead ends: 99 [2018-12-03 19:36:13,039 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 19:36:13,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 19:36:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 19:36:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 19:36:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 19:36:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 19:36:13,045 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-03 19:36:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:13,046 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 19:36:13,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 19:36:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 19:36:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 19:36:13,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:13,046 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-03 19:36:13,047 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:13,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-03 19:36:13,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:13,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:13,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:13,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:14,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:14,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:14,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:14,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:14,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:14,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:14,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:14,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:14,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 19:36:14,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:14,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:16,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:19,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:19,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-03 19:36:19,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:19,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 19:36:19,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 19:36:19,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 19:36:19,407 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-12-03 19:36:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:19,627 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 19:36:19,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 19:36:19,627 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-12-03 19:36:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:19,628 INFO L225 Difference]: With dead ends: 101 [2018-12-03 19:36:19,628 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 19:36:19,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 19:36:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 19:36:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 19:36:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 19:36:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 19:36:19,634 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-03 19:36:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:19,635 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 19:36:19,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 19:36:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 19:36:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 19:36:19,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:19,636 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-03 19:36:19,636 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:19,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-03 19:36:19,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:19,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:19,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:19,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:20,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:20,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:20,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:20,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:20,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:20,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:20,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:20,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:20,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:20,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:20,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:22,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:25,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:25,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-03 19:36:25,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:25,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 19:36:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 19:36:25,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 19:36:25,488 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-12-03 19:36:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:25,712 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 19:36:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 19:36:25,712 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-12-03 19:36:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:25,713 INFO L225 Difference]: With dead ends: 103 [2018-12-03 19:36:25,713 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 19:36:25,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 19:36:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 19:36:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 19:36:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 19:36:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 19:36:25,719 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-03 19:36:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:25,720 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 19:36:25,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 19:36:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 19:36:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 19:36:25,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:25,721 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-03 19:36:25,721 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:25,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-03 19:36:25,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:25,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:25,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:27,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:27,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:27,089 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:27,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:27,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:27,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:27,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:27,099 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:27,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:29,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:32,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:32,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-03 19:36:32,914 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:32,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 19:36:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 19:36:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 19:36:32,916 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-12-03 19:36:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:33,180 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 19:36:33,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 19:36:33,181 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-12-03 19:36:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:33,182 INFO L225 Difference]: With dead ends: 105 [2018-12-03 19:36:33,182 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 19:36:33,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 19:36:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 19:36:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 19:36:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 19:36:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 19:36:33,188 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-03 19:36:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:33,189 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 19:36:33,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 19:36:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 19:36:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 19:36:33,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:33,190 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-03 19:36:33,190 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:33,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:33,190 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-03 19:36:33,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:33,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:33,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:33,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:33,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:34,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:34,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:34,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:34,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:34,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:34,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:34,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:34,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:34,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 19:36:34,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:34,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:36,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:39,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:39,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2018-12-03 19:36:39,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:39,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 19:36:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 19:36:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 19:36:39,669 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-12-03 19:36:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:40,759 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 19:36:40,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 19:36:40,760 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-12-03 19:36:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:40,761 INFO L225 Difference]: With dead ends: 107 [2018-12-03 19:36:40,762 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 19:36:40,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10302 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 19:36:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 19:36:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 19:36:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 19:36:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 19:36:40,767 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-03 19:36:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:40,767 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 19:36:40,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 19:36:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 19:36:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 19:36:40,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:40,768 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-03 19:36:40,769 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:40,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-03 19:36:40,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:40,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:40,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:42,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:42,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:42,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:42,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:42,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:42,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:42,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:42,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:42,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:42,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:42,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:43,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:47,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:47,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 156 [2018-12-03 19:36:47,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:47,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 19:36:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 19:36:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 19:36:47,014 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-12-03 19:36:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:47,277 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 19:36:47,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 19:36:47,277 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-12-03 19:36:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:47,278 INFO L225 Difference]: With dead ends: 109 [2018-12-03 19:36:47,278 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 19:36:47,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10712 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 19:36:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 19:36:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 19:36:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 19:36:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 19:36:47,285 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-03 19:36:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:47,286 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 19:36:47,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 19:36:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 19:36:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 19:36:47,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:47,287 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-03 19:36:47,287 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:47,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-03 19:36:47,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:47,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:47,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:48,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:48,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:48,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:48,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:48,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:48,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:48,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:48,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:48,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:50,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:54,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:54,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 159 [2018-12-03 19:36:54,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:54,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 19:36:54,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 19:36:54,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 19:36:54,288 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-12-03 19:36:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:54,564 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 19:36:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 19:36:54,565 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-12-03 19:36:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:54,565 INFO L225 Difference]: With dead ends: 111 [2018-12-03 19:36:54,566 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 19:36:54,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11130 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 19:36:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 19:36:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 19:36:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 19:36:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 19:36:54,571 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-03 19:36:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:54,571 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 19:36:54,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 19:36:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 19:36:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 19:36:54,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:54,572 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-03 19:36:54,572 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:54,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-03 19:36:54,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:54,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:54,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:54,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:54,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:55,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:55,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:55,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:55,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:55,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:55,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:55,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:55,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:55,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 19:36:55,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:55,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:57,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:01,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:01,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 162 [2018-12-03 19:37:01,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:01,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 19:37:01,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 19:37:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 19:37:01,144 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-12-03 19:37:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:01,387 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 19:37:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 19:37:01,388 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-12-03 19:37:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:01,389 INFO L225 Difference]: With dead ends: 113 [2018-12-03 19:37:01,389 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 19:37:01,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11556 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 19:37:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 19:37:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 19:37:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 19:37:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 19:37:01,394 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-03 19:37:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:01,394 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 19:37:01,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 19:37:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 19:37:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 19:37:01,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:01,395 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-03 19:37:01,395 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:01,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-03 19:37:01,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:01,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:01,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:03,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:03,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:03,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:03,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:03,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:03,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:03,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:03,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:03,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:03,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:03,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:05,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:08,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:08,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 165 [2018-12-03 19:37:08,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:08,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 19:37:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 19:37:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 19:37:08,997 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-12-03 19:37:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:10,041 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 19:37:10,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 19:37:10,041 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-12-03 19:37:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:10,043 INFO L225 Difference]: With dead ends: 115 [2018-12-03 19:37:10,043 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 19:37:10,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11990 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 19:37:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 19:37:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 19:37:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 19:37:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 19:37:10,050 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-03 19:37:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:10,050 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 19:37:10,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 19:37:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 19:37:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 19:37:10,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:10,051 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-03 19:37:10,051 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:10,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-03 19:37:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:10,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:10,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:10,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:11,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:11,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:11,411 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:11,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:11,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:11,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:11,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:11,422 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:11,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:13,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:17,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:17,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 168 [2018-12-03 19:37:17,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:17,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 19:37:17,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 19:37:17,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 19:37:17,195 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-12-03 19:37:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:17,476 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 19:37:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 19:37:17,477 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-12-03 19:37:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:17,477 INFO L225 Difference]: With dead ends: 117 [2018-12-03 19:37:17,478 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 19:37:17,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12432 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 19:37:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 19:37:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 19:37:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 19:37:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 19:37:17,483 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-03 19:37:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:17,483 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 19:37:17,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 19:37:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 19:37:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 19:37:17,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:17,484 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-03 19:37:17,485 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:17,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-03 19:37:17,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:17,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:17,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:19,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:19,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:19,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:19,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:19,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:19,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:19,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:19,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:19,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 19:37:19,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:19,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:21,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:25,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:25,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 171 [2018-12-03 19:37:25,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:25,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 19:37:25,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 19:37:25,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 19:37:25,250 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-12-03 19:37:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:25,574 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-03 19:37:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 19:37:25,574 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-12-03 19:37:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:25,575 INFO L225 Difference]: With dead ends: 119 [2018-12-03 19:37:25,576 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 19:37:25,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 19:37:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 19:37:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 19:37:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 19:37:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 19:37:25,581 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-03 19:37:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:25,582 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 19:37:25,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 19:37:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 19:37:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 19:37:25,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:25,582 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-03 19:37:25,582 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:25,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-03 19:37:25,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:25,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:25,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:25,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:25,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:27,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:27,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:27,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:27,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:27,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:27,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:27,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:27,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:27,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:27,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:27,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:29,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:33,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:33,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 174 [2018-12-03 19:37:33,433 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:33,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 19:37:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 19:37:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 19:37:33,436 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-12-03 19:37:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:33,730 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-12-03 19:37:33,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 19:37:33,730 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-12-03 19:37:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:33,732 INFO L225 Difference]: With dead ends: 121 [2018-12-03 19:37:33,732 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 19:37:33,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13340 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 19:37:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 19:37:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 19:37:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 19:37:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-03 19:37:33,739 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-03 19:37:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:33,739 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-03 19:37:33,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 19:37:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-03 19:37:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 19:37:33,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:33,740 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-03 19:37:33,740 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:33,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-03 19:37:33,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:33,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:33,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:33,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:35,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:35,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:35,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:35,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:35,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:35,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:35,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:35,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:35,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:37,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:41,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:41,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 177 [2018-12-03 19:37:41,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:41,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 19:37:41,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 19:37:41,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 19:37:41,954 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-12-03 19:37:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:42,235 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-03 19:37:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 19:37:42,236 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-12-03 19:37:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:42,237 INFO L225 Difference]: With dead ends: 123 [2018-12-03 19:37:42,237 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 19:37:42,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13806 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 19:37:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 19:37:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 19:37:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 19:37:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-03 19:37:42,244 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-03 19:37:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:42,245 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-03 19:37:42,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 19:37:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-03 19:37:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 19:37:42,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:42,246 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-03 19:37:42,246 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:42,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:42,246 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-03 19:37:42,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:42,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:42,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:42,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:42,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:44,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:44,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:44,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:44,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:44,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:44,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:44,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:44,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:44,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 19:37:44,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:44,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:46,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:51,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:51,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 180 [2018-12-03 19:37:51,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:51,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 19:37:51,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 19:37:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 19:37:51,183 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-12-03 19:37:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:51,478 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-12-03 19:37:51,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 19:37:51,478 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-12-03 19:37:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:51,479 INFO L225 Difference]: With dead ends: 125 [2018-12-03 19:37:51,479 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 19:37:51,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14280 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 19:37:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 19:37:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 19:37:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 19:37:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-03 19:37:51,486 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-03 19:37:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:51,486 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-03 19:37:51,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 19:37:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-03 19:37:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 19:37:51,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:51,487 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-03 19:37:51,487 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:51,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-03 19:37:51,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:51,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:51,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:53,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:53,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:53,333 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:53,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:53,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:53,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:53,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:53,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:53,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:53,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:53,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:55,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:00,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:00,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 183 [2018-12-03 19:38:00,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:00,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 19:38:00,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 19:38:00,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 19:38:00,355 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-12-03 19:38:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:00,630 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-12-03 19:38:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 19:38:00,631 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-12-03 19:38:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:00,632 INFO L225 Difference]: With dead ends: 127 [2018-12-03 19:38:00,632 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 19:38:00,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14762 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 19:38:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 19:38:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 19:38:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 19:38:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-03 19:38:00,638 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-03 19:38:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:00,638 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-03 19:38:00,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 19:38:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-03 19:38:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 19:38:00,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:00,639 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-03 19:38:00,639 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:00,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-03 19:38:00,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:00,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:00,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:00,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:02,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:02,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:02,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:02,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:02,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:02,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:02,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:02,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:02,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:04,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:09,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:09,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 186 [2018-12-03 19:38:09,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:09,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 19:38:09,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 19:38:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 19:38:09,206 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-12-03 19:38:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:09,501 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-03 19:38:09,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 19:38:09,502 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-12-03 19:38:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:09,503 INFO L225 Difference]: With dead ends: 129 [2018-12-03 19:38:09,503 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 19:38:09,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15252 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 19:38:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 19:38:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 19:38:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 19:38:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-03 19:38:09,509 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-03 19:38:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:09,509 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-03 19:38:09,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 19:38:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-03 19:38:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 19:38:09,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:09,510 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-03 19:38:09,510 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:09,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-03 19:38:09,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:09,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:09,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:12,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:12,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:12,290 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:12,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:12,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:12,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:12,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:12,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:12,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 19:38:12,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:12,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:14,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:19,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 189 [2018-12-03 19:38:19,499 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:19,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 19:38:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 19:38:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 19:38:19,501 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-12-03 19:38:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:19,814 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-12-03 19:38:19,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 19:38:19,815 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-12-03 19:38:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:19,815 INFO L225 Difference]: With dead ends: 131 [2018-12-03 19:38:19,815 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 19:38:19,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15750 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 19:38:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 19:38:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 19:38:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 19:38:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-03 19:38:19,821 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-03 19:38:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:19,822 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-03 19:38:19,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 19:38:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-03 19:38:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 19:38:19,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:19,823 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-03 19:38:19,823 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:19,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-03 19:38:19,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:19,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:19,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:22,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:22,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:22,361 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:22,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:22,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:22,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:22,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:38:22,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:38:22,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:38:22,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:22,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:24,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:29,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:29,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 192 [2018-12-03 19:38:29,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:29,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 19:38:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 19:38:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 19:38:29,660 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-12-03 19:38:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:30,006 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-12-03 19:38:30,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 19:38:30,007 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-12-03 19:38:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:30,008 INFO L225 Difference]: With dead ends: 133 [2018-12-03 19:38:30,008 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 19:38:30,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16256 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 19:38:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 19:38:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 19:38:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 19:38:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-03 19:38:30,014 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-03 19:38:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:30,014 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-03 19:38:30,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 19:38:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-03 19:38:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 19:38:30,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:30,015 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-03 19:38:30,016 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:30,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-03 19:38:30,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:30,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:30,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:30,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:30,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:32,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:32,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:32,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:32,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:32,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:32,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:32,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:32,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:32,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:34,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:39,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:39,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 195 [2018-12-03 19:38:39,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:39,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 19:38:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 19:38:39,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 19:38:39,882 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-12-03 19:38:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:40,175 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-03 19:38:40,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 19:38:40,175 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-12-03 19:38:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:40,176 INFO L225 Difference]: With dead ends: 135 [2018-12-03 19:38:40,176 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 19:38:40,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16770 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 19:38:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 19:38:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 19:38:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 19:38:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-03 19:38:40,182 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-03 19:38:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:40,182 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-03 19:38:40,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 19:38:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-03 19:38:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 19:38:40,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:40,183 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-03 19:38:40,183 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:40,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-03 19:38:40,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:40,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:40,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:40,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:40,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:42,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:42,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:42,355 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:42,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:42,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:42,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:42,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:42,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:42,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 19:38:42,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:42,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:45,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:50,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:50,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 198 [2018-12-03 19:38:50,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:50,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 19:38:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 19:38:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 19:38:50,864 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-12-03 19:38:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:51,310 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-12-03 19:38:51,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 19:38:51,310 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-12-03 19:38:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:51,311 INFO L225 Difference]: With dead ends: 137 [2018-12-03 19:38:51,311 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 19:38:51,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17292 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 19:38:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 19:38:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 19:38:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 19:38:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-03 19:38:51,317 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-03 19:38:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:51,317 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-03 19:38:51,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 19:38:51,318 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-03 19:38:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 19:38:51,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:51,318 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-03 19:38:51,319 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:51,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-03 19:38:51,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:51,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:51,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:53,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:53,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:53,218 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:53,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:53,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:53,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:53,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:38:53,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:38:53,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:38:53,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:53,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:55,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:01,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:01,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 201 [2018-12-03 19:39:01,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:01,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 19:39:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 19:39:01,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 19:39:01,629 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-12-03 19:39:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:02,035 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-12-03 19:39:02,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 19:39:02,036 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-12-03 19:39:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:02,037 INFO L225 Difference]: With dead ends: 139 [2018-12-03 19:39:02,037 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 19:39:02,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17822 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 19:39:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 19:39:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 19:39:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 19:39:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-12-03 19:39:02,044 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-12-03 19:39:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:02,045 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-12-03 19:39:02,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 19:39:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-12-03 19:39:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 19:39:02,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:02,045 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-12-03 19:39:02,046 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:02,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-12-03 19:39:02,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:02,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:02,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:02,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:02,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:04,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:04,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:04,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:04,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:04,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:04,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:39:04,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:04,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:39:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:04,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:06,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:12,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:12,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 204 [2018-12-03 19:39:12,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:12,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 19:39:12,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 19:39:12,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 19:39:12,375 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-12-03 19:39:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:12,714 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-03 19:39:12,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 19:39:12,714 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-12-03 19:39:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:12,715 INFO L225 Difference]: With dead ends: 141 [2018-12-03 19:39:12,715 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 19:39:12,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18360 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 19:39:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 19:39:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 19:39:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 19:39:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-12-03 19:39:12,720 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-12-03 19:39:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:12,720 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-12-03 19:39:12,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 19:39:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-12-03 19:39:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 19:39:12,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:12,721 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-12-03 19:39:12,721 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:12,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:12,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-12-03 19:39:12,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:12,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:12,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:12,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:12,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:14,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:14,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:14,676 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:14,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:14,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:14,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:39:14,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:39:14,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:39:14,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 19:39:14,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:14,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:17,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:23,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:23,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 207 [2018-12-03 19:39:23,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:23,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 19:39:23,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 19:39:23,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 19:39:23,144 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-12-03 19:39:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:23,479 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-12-03 19:39:23,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 19:39:23,479 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-12-03 19:39:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:23,480 INFO L225 Difference]: With dead ends: 143 [2018-12-03 19:39:23,480 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 19:39:23,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18906 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 19:39:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 19:39:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 19:39:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 19:39:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-12-03 19:39:23,486 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-12-03 19:39:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:23,486 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-12-03 19:39:23,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 19:39:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-12-03 19:39:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 19:39:23,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:23,487 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-12-03 19:39:23,487 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:23,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-12-03 19:39:23,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:23,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:23,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:25,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:25,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:25,526 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:25,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:25,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:25,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:39:25,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:39:25,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:39:25,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:39:25,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:25,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:28,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:34,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:34,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 210 [2018-12-03 19:39:34,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:34,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 19:39:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 19:39:34,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 19:39:34,050 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-12-03 19:39:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:34,495 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-12-03 19:39:34,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 19:39:34,496 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-12-03 19:39:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:34,497 INFO L225 Difference]: With dead ends: 145 [2018-12-03 19:39:34,497 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 19:39:34,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19460 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 19:39:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 19:39:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 19:39:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 19:39:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-12-03 19:39:34,502 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-12-03 19:39:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:34,502 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-12-03 19:39:34,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 19:39:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-12-03 19:39:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 19:39:34,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:34,503 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-12-03 19:39:34,503 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:34,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-12-03 19:39:34,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:34,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:34,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:36,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:36,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:36,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:36,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:36,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:36,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:39:36,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:36,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:39:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:36,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:39,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:45,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:45,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 213 [2018-12-03 19:39:45,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:45,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 19:39:45,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 19:39:45,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 19:39:45,361 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-12-03 19:39:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:45,765 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-03 19:39:45,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 19:39:45,765 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-12-03 19:39:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:45,766 INFO L225 Difference]: With dead ends: 147 [2018-12-03 19:39:45,766 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 19:39:45,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20022 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 19:39:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 19:39:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 19:39:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 19:39:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-12-03 19:39:45,773 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-12-03 19:39:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:45,773 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-12-03 19:39:45,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 19:39:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-12-03 19:39:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 19:39:45,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:45,774 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-12-03 19:39:45,774 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:45,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:45,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-12-03 19:39:45,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:45,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:45,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:45,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:45,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:48,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:48,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:48,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:48,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:48,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:48,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:39:48,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:39:48,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:39:48,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 19:39:48,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:48,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:51,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:57,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:57,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 216 [2018-12-03 19:39:57,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:57,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 19:39:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 19:39:57,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 19:39:57,268 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-12-03 19:39:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:57,723 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-12-03 19:39:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 19:39:57,723 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-12-03 19:39:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:57,724 INFO L225 Difference]: With dead ends: 149 [2018-12-03 19:39:57,724 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 19:39:57,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20592 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 19:39:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 19:39:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 19:39:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 19:39:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-12-03 19:39:57,733 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-12-03 19:39:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:57,733 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-12-03 19:39:57,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 19:39:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-12-03 19:39:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 19:39:57,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:57,734 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-12-03 19:39:57,734 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:57,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:57,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-12-03 19:39:57,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:57,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:57,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:57,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:59,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:59,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:59,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:59,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:59,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:59,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:39:59,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:39:59,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:39:59,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:39:59,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:59,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:02,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:08,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:08,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 219 [2018-12-03 19:40:08,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:08,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-03 19:40:08,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-03 19:40:08,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 19:40:08,882 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-12-03 19:40:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:09,277 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-12-03 19:40:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 19:40:09,277 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-12-03 19:40:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:09,279 INFO L225 Difference]: With dead ends: 151 [2018-12-03 19:40:09,279 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 19:40:09,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21170 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 19:40:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 19:40:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 19:40:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 19:40:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-12-03 19:40:09,287 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-12-03 19:40:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:09,287 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-12-03 19:40:09,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-03 19:40:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-12-03 19:40:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 19:40:09,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:09,288 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-12-03 19:40:09,288 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:09,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-12-03 19:40:09,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:09,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:09,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:09,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:09,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:11,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:11,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:11,547 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:11,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:11,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:11,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:40:11,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:11,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:40:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:11,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:14,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:20,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:20,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 222 [2018-12-03 19:40:20,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:20,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 19:40:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 19:40:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 19:40:20,660 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-12-03 19:40:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:21,039 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-03 19:40:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 19:40:21,040 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-12-03 19:40:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:21,041 INFO L225 Difference]: With dead ends: 153 [2018-12-03 19:40:21,041 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 19:40:21,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21756 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 19:40:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 19:40:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 19:40:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 19:40:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-12-03 19:40:21,047 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-12-03 19:40:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:21,047 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-12-03 19:40:21,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 19:40:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-12-03 19:40:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 19:40:21,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:21,048 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-12-03 19:40:21,048 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:21,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:21,049 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-12-03 19:40:21,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:21,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:21,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:21,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:21,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:23,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:23,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:23,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:23,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:23,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:23,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:40:23,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:40:23,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:40:23,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 19:40:23,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:23,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:26,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:32,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:32,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 225 [2018-12-03 19:40:32,631 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:32,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-03 19:40:32,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-03 19:40:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 19:40:32,635 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-12-03 19:40:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:33,018 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-12-03 19:40:33,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 19:40:33,019 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-12-03 19:40:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:33,020 INFO L225 Difference]: With dead ends: 155 [2018-12-03 19:40:33,020 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 19:40:33,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22350 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 19:40:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 19:40:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 19:40:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 19:40:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-12-03 19:40:33,025 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-12-03 19:40:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:33,025 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-12-03 19:40:33,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-03 19:40:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-12-03 19:40:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 19:40:33,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:33,026 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-12-03 19:40:33,026 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:33,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:33,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-12-03 19:40:33,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:33,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:33,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:33,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:33,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:35,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:35,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:35,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:35,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:35,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:35,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:40:35,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:40:35,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:40:35,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:40:35,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:35,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:38,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:44,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:44,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 228 [2018-12-03 19:40:44,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:44,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-03 19:40:44,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-03 19:40:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 19:40:44,790 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-12-03 19:40:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:45,217 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-12-03 19:40:45,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 19:40:45,218 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-12-03 19:40:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:45,218 INFO L225 Difference]: With dead ends: 157 [2018-12-03 19:40:45,218 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 19:40:45,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22952 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 19:40:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 19:40:45,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 19:40:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 19:40:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-12-03 19:40:45,224 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-12-03 19:40:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:45,224 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-12-03 19:40:45,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-03 19:40:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-12-03 19:40:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 19:40:45,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:45,225 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-12-03 19:40:45,225 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:45,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-12-03 19:40:45,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:45,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:45,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:47,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:47,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:47,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:47,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:47,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:47,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:40:47,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:47,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:40:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:47,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:50,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:57,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:57,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 231 [2018-12-03 19:40:57,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:57,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-03 19:40:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-03 19:40:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 19:40:57,252 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-12-03 19:40:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:57,606 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-03 19:40:57,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 19:40:57,606 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-12-03 19:40:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:57,607 INFO L225 Difference]: With dead ends: 159 [2018-12-03 19:40:57,607 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 19:40:57,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23562 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 19:40:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 19:40:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 19:40:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 19:40:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-12-03 19:40:57,612 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-12-03 19:40:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:57,613 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-12-03 19:40:57,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-03 19:40:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-12-03 19:40:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 19:40:57,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:57,613 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-12-03 19:40:57,614 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:57,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-12-03 19:40:57,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:57,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:57,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:57,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:00,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:00,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:00,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:00,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:00,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:00,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:41:00,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:41:00,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:41:00,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 19:41:00,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:00,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:03,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:09,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:09,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 234 [2018-12-03 19:41:09,973 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:09,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-03 19:41:09,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-03 19:41:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 19:41:09,977 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-12-03 19:41:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:10,381 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-12-03 19:41:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 19:41:10,381 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-12-03 19:41:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:10,382 INFO L225 Difference]: With dead ends: 161 [2018-12-03 19:41:10,382 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 19:41:10,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24180 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 19:41:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 19:41:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 19:41:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 19:41:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-12-03 19:41:10,391 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-12-03 19:41:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:10,391 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-12-03 19:41:10,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-03 19:41:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-12-03 19:41:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 19:41:10,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:10,392 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-12-03 19:41:10,392 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:10,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-12-03 19:41:10,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:10,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:10,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:10,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:10,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:13,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:13,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:13,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:13,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:13,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:13,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:41:13,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:41:13,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:41:13,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:41:13,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:13,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:16,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:23,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:23,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 237 [2018-12-03 19:41:23,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:23,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-03 19:41:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-03 19:41:23,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 19:41:23,147 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-12-03 19:41:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:23,557 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-12-03 19:41:23,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 19:41:23,557 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-12-03 19:41:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:23,559 INFO L225 Difference]: With dead ends: 163 [2018-12-03 19:41:23,559 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 19:41:23,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24806 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 19:41:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 19:41:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 19:41:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 19:41:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-12-03 19:41:23,566 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-12-03 19:41:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:23,567 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-12-03 19:41:23,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-03 19:41:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-12-03 19:41:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 19:41:23,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:23,568 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-12-03 19:41:23,568 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:23,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-12-03 19:41:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:23,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:23,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:26,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:26,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:26,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:26,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:26,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:26,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:41:26,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:26,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:41:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:26,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:29,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:36,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:36,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 240 [2018-12-03 19:41:36,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:36,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 19:41:36,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 19:41:36,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 19:41:36,528 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-12-03 19:41:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:36,920 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-03 19:41:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 19:41:36,920 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-12-03 19:41:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:36,921 INFO L225 Difference]: With dead ends: 165 [2018-12-03 19:41:36,921 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 19:41:36,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25440 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 19:41:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 19:41:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 19:41:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 19:41:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-12-03 19:41:36,928 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-12-03 19:41:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:36,928 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-12-03 19:41:36,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 19:41:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-12-03 19:41:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 19:41:36,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:36,929 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-12-03 19:41:36,929 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:36,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:36,930 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-12-03 19:41:36,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:36,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:36,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:36,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:36,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:39,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:39,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:39,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:39,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:39,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:39,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:41:39,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:41:39,552 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:41:39,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 19:41:39,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:39,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:42,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:50,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:50,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 243 [2018-12-03 19:41:50,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:50,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-03 19:41:50,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-03 19:41:50,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 19:41:50,222 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-12-03 19:41:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:50,615 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-12-03 19:41:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 19:41:50,615 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-12-03 19:41:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:50,616 INFO L225 Difference]: With dead ends: 167 [2018-12-03 19:41:50,616 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 19:41:50,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26082 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 19:41:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 19:41:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 19:41:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 19:41:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-12-03 19:41:50,621 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-12-03 19:41:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:50,621 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-12-03 19:41:50,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-03 19:41:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-12-03 19:41:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 19:41:50,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:50,622 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-12-03 19:41:50,622 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:50,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:50,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-12-03 19:41:50,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:50,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:50,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:53,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:53,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:53,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:53,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:53,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:53,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:41:53,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:41:53,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:41:53,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:41:53,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:53,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:56,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:04,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:04,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 246 [2018-12-03 19:42:04,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:04,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-03 19:42:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-03 19:42:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 19:42:04,250 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-12-03 19:42:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:04,680 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-12-03 19:42:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 19:42:04,681 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-12-03 19:42:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:04,682 INFO L225 Difference]: With dead ends: 169 [2018-12-03 19:42:04,682 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 19:42:04,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26732 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 19:42:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 19:42:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 19:42:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 19:42:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-12-03 19:42:04,688 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-12-03 19:42:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:04,688 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-12-03 19:42:04,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-03 19:42:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-12-03 19:42:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 19:42:04,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:04,689 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-12-03 19:42:04,689 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:04,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:04,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-12-03 19:42:04,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:04,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:42:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:04,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:07,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:07,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:07,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:07,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:07,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:07,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:42:07,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:07,428 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:42:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:07,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:10,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:18,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:18,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 249 [2018-12-03 19:42:18,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:18,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-03 19:42:18,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-03 19:42:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 19:42:18,577 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-12-03 19:42:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:19,271 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-03 19:42:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 19:42:19,271 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-12-03 19:42:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:19,272 INFO L225 Difference]: With dead ends: 171 [2018-12-03 19:42:19,272 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 19:42:19,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27390 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 19:42:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 19:42:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 19:42:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 19:42:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-12-03 19:42:19,277 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-12-03 19:42:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:19,277 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-12-03 19:42:19,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-03 19:42:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-12-03 19:42:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 19:42:19,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:19,278 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-12-03 19:42:19,278 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:19,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:19,279 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-12-03 19:42:19,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:19,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:19,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:22,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:22,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:22,072 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:22,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:22,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:22,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:42:22,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:42:22,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:42:22,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 19:42:22,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:42:22,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:25,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:33,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:33,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 252 [2018-12-03 19:42:33,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:33,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-03 19:42:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-03 19:42:33,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 19:42:33,529 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-12-03 19:42:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:33,941 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-12-03 19:42:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 19:42:33,941 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-12-03 19:42:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:33,942 INFO L225 Difference]: With dead ends: 173 [2018-12-03 19:42:33,942 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 19:42:33,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28056 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 19:42:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 19:42:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 19:42:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 19:42:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-12-03 19:42:33,947 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-12-03 19:42:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:33,948 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-12-03 19:42:33,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-03 19:42:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-12-03 19:42:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 19:42:33,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:33,948 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-12-03 19:42:33,949 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:33,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-12-03 19:42:33,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:33,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:42:33,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:33,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:36,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:36,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:36,807 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:36,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:36,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:36,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:42:36,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:42:36,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:42:36,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:42:36,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:42:36,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:40,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:48,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:48,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 255 [2018-12-03 19:42:48,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:48,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-03 19:42:48,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-03 19:42:48,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 19:42:48,520 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-12-03 19:42:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:48,930 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-12-03 19:42:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 19:42:48,930 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-12-03 19:42:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:48,931 INFO L225 Difference]: With dead ends: 175 [2018-12-03 19:42:48,931 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 19:42:48,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28730 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 19:42:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 19:42:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 19:42:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 19:42:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-12-03 19:42:48,938 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-12-03 19:42:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:48,938 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-12-03 19:42:48,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-03 19:42:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-12-03 19:42:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 19:42:48,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:48,939 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-12-03 19:42:48,940 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:48,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-12-03 19:42:48,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:48,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:42:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:48,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:51,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:51,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:51,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:51,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:51,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:51,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:42:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:51,960 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:42:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:52,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:55,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:03,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:03,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 258 [2018-12-03 19:43:03,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:03,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 19:43:03,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 19:43:03,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 19:43:03,915 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-12-03 19:43:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:04,342 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-03 19:43:04,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 19:43:04,343 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-12-03 19:43:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:04,343 INFO L225 Difference]: With dead ends: 177 [2018-12-03 19:43:04,344 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 19:43:04,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29412 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 19:43:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 19:43:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 19:43:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 19:43:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-12-03 19:43:04,351 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-12-03 19:43:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:04,351 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-12-03 19:43:04,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 19:43:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-12-03 19:43:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 19:43:04,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:04,352 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-12-03 19:43:04,352 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:04,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:04,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-12-03 19:43:04,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:04,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:43:04,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:04,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:07,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:07,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:07,373 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:07,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:07,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:07,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:43:07,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:43:07,381 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:43:07,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 19:43:07,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:43:07,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:43:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:11,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:19,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:19,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 261 [2018-12-03 19:43:19,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:19,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-03 19:43:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-03 19:43:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 19:43:19,696 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-12-03 19:43:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:20,153 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-12-03 19:43:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 19:43:20,153 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-12-03 19:43:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:20,154 INFO L225 Difference]: With dead ends: 179 [2018-12-03 19:43:20,154 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 19:43:20,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30102 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 19:43:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 19:43:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 19:43:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 19:43:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-12-03 19:43:20,159 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-12-03 19:43:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:20,159 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-12-03 19:43:20,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-03 19:43:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-12-03 19:43:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 19:43:20,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:20,160 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-12-03 19:43:20,160 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:20,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-12-03 19:43:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:20,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:43:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:20,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:23,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:23,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:23,224 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:23,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:23,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:23,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:43:23,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:43:23,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:43:23,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:43:23,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:43:23,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:43:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:27,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:35,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:35,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 264 [2018-12-03 19:43:35,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:35,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-03 19:43:35,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-03 19:43:35,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 19:43:35,840 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-12-03 19:43:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:36,321 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-12-03 19:43:36,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 19:43:36,321 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-12-03 19:43:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:36,323 INFO L225 Difference]: With dead ends: 181 [2018-12-03 19:43:36,323 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 19:43:36,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30800 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 19:43:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 19:43:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 19:43:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 19:43:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-12-03 19:43:36,328 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-12-03 19:43:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:36,328 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-12-03 19:43:36,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-03 19:43:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-12-03 19:43:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 19:43:36,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:36,329 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-12-03 19:43:36,329 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:36,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-12-03 19:43:36,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:36,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:36,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:43:36,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:36,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:39,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:39,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:39,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:39,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:39,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:39,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:43:39,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:43:39,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:43:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:39,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:43:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:43,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:52,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:52,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 267 [2018-12-03 19:43:52,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:52,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-03 19:43:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-03 19:43:52,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 19:43:52,313 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-12-03 19:43:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:52,809 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-03 19:43:52,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 19:43:52,810 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-12-03 19:43:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:52,810 INFO L225 Difference]: With dead ends: 183 [2018-12-03 19:43:52,810 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 19:43:52,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31506 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 19:43:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 19:43:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 19:43:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 19:43:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-12-03 19:43:52,816 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-12-03 19:43:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:52,816 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-12-03 19:43:52,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-03 19:43:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-12-03 19:43:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 19:43:52,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:52,817 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-12-03 19:43:52,817 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:52,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:52,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-12-03 19:43:52,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:52,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:52,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:43:52,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:52,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:56,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:56,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:56,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:56,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:56,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:56,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:43:56,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:43:56,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:43:56,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 19:43:56,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:43:56,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:00,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:09,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:09,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 270 [2018-12-03 19:44:09,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:09,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-03 19:44:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-03 19:44:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 19:44:09,158 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-12-03 19:44:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:09,592 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-12-03 19:44:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 19:44:09,593 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-12-03 19:44:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:09,594 INFO L225 Difference]: With dead ends: 185 [2018-12-03 19:44:09,594 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 19:44:09,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32220 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 19:44:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 19:44:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 19:44:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 19:44:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-12-03 19:44:09,599 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-12-03 19:44:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:09,599 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-12-03 19:44:09,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-03 19:44:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-12-03 19:44:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 19:44:09,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:09,600 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-12-03 19:44:09,600 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:09,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-12-03 19:44:09,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:09,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:09,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:44:09,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:09,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:12,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:12,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:12,892 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:12,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:12,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:12,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:44:12,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:44:12,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:44:12,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:44:12,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:12,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:17,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:26,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:26,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 273 [2018-12-03 19:44:26,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:26,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-03 19:44:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-03 19:44:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 19:44:26,276 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2018-12-03 19:44:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:26,776 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-12-03 19:44:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 19:44:26,776 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 183 [2018-12-03 19:44:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:26,777 INFO L225 Difference]: With dead ends: 187 [2018-12-03 19:44:26,777 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 19:44:26,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32942 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 19:44:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 19:44:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 19:44:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 19:44:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-12-03 19:44:26,784 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-12-03 19:44:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:26,784 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-12-03 19:44:26,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-03 19:44:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-12-03 19:44:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 19:44:26,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:26,785 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-12-03 19:44:26,786 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:26,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-12-03 19:44:26,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:26,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:26,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:44:26,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:26,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:30,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:30,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:30,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:30,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:30,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:30,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:44:30,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:30,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:44:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:30,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:34,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:43,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:43,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 276 [2018-12-03 19:44:43,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:43,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 19:44:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 19:44:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 19:44:43,833 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 186 states. [2018-12-03 19:44:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:44,281 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-03 19:44:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 19:44:44,282 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 185 [2018-12-03 19:44:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:44,282 INFO L225 Difference]: With dead ends: 189 [2018-12-03 19:44:44,283 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 19:44:44,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33672 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 19:44:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 19:44:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 19:44:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 19:44:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-12-03 19:44:44,290 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-12-03 19:44:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:44,291 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-12-03 19:44:44,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 19:44:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-12-03 19:44:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 19:44:44,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:44,292 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-12-03 19:44:44,292 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:44,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-12-03 19:44:44,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:44,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:44,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:44,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:44,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:47,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:47,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:47,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:47,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:47,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:47,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:44:47,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:44:47,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:44:47,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 19:44:47,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:47,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:52,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:01,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:01,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 279 [2018-12-03 19:45:01,786 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:01,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-03 19:45:01,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-03 19:45:01,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 19:45:01,790 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 188 states. [2018-12-03 19:45:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:02,361 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-12-03 19:45:02,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 19:45:02,361 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 187 [2018-12-03 19:45:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:02,362 INFO L225 Difference]: With dead ends: 191 [2018-12-03 19:45:02,362 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 19:45:02,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34410 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 19:45:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 19:45:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 19:45:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 19:45:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-12-03 19:45:02,368 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-12-03 19:45:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:02,369 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-12-03 19:45:02,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-03 19:45:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-12-03 19:45:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 19:45:02,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:02,370 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-12-03 19:45:02,370 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:02,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-12-03 19:45:02,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:02,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:45:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:02,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:05,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:05,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:45:05,862 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:45:05,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:45:05,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:05,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:45:05,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:45:05,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:45:05,921 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:45:05,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:45:05,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:10,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:20,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:20,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 282 [2018-12-03 19:45:20,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:20,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-03 19:45:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-03 19:45:20,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 19:45:20,149 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 190 states. [2018-12-03 19:45:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:20,674 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-12-03 19:45:20,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 19:45:20,674 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 189 [2018-12-03 19:45:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:20,675 INFO L225 Difference]: With dead ends: 193 [2018-12-03 19:45:20,675 INFO L226 Difference]: Without dead ends: 192 [2018-12-03 19:45:20,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35156 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 19:45:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-03 19:45:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-12-03 19:45:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 19:45:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-12-03 19:45:20,680 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-12-03 19:45:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:20,681 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-12-03 19:45:20,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-03 19:45:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-12-03 19:45:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 19:45:20,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:20,682 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-12-03 19:45:20,682 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:20,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:20,682 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-12-03 19:45:20,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:20,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:45:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:20,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:24,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:24,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:45:24,257 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:45:24,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:45:24,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:24,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:45:24,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:45:24,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:45:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:24,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:28,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:38,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:38,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 285 [2018-12-03 19:45:38,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:38,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-03 19:45:38,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-03 19:45:38,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 19:45:38,840 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 192 states. [2018-12-03 19:45:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:39,358 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-03 19:45:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 19:45:39,358 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 191 [2018-12-03 19:45:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:39,359 INFO L225 Difference]: With dead ends: 195 [2018-12-03 19:45:39,359 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 19:45:39,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35910 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 19:45:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 19:45:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-12-03 19:45:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 19:45:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-12-03 19:45:39,365 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-12-03 19:45:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:39,366 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-12-03 19:45:39,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-03 19:45:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-12-03 19:45:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 19:45:39,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:39,366 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-12-03 19:45:39,367 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:39,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-12-03 19:45:39,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:39,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:45:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:39,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:43,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:43,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:45:43,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:45:43,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:45:43,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:43,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:45:43,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:45:43,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:45:43,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 19:45:43,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:45:43,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:47,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:58,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:58,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 288 [2018-12-03 19:45:58,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:58,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-03 19:45:58,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-03 19:45:58,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 19:45:58,111 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 194 states. [2018-12-03 19:45:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:58,608 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-12-03 19:45:58,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 19:45:58,608 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 193 [2018-12-03 19:45:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:58,609 INFO L225 Difference]: With dead ends: 197 [2018-12-03 19:45:58,609 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 19:45:58,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36672 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 19:45:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 19:45:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 19:45:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 19:45:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-12-03 19:45:58,614 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-12-03 19:45:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:58,615 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-12-03 19:45:58,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-03 19:45:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-12-03 19:45:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 19:45:58,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:58,616 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-12-03 19:45:58,616 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:58,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-12-03 19:45:58,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:58,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:58,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:45:58,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:58,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:02,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:02,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:02,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:02,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:02,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:02,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:46:02,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:46:02,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:46:02,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:46:02,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:46:02,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:06,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:17,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:17,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 291 [2018-12-03 19:46:17,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:17,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-12-03 19:46:17,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-12-03 19:46:17,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38122, Invalid=47434, Unknown=0, NotChecked=0, Total=85556 [2018-12-03 19:46:17,560 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 196 states. [2018-12-03 19:46:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:18,111 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-12-03 19:46:18,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 19:46:18,111 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 195 [2018-12-03 19:46:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:18,112 INFO L225 Difference]: With dead ends: 199 [2018-12-03 19:46:18,112 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 19:46:18,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37442 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=38122, Invalid=47434, Unknown=0, NotChecked=0, Total=85556 [2018-12-03 19:46:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 19:46:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 19:46:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 19:46:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-12-03 19:46:18,119 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-12-03 19:46:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:18,119 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-12-03 19:46:18,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-12-03 19:46:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-12-03 19:46:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 19:46:18,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:18,120 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2018-12-03 19:46:18,120 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:18,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:18,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2018-12-03 19:46:18,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:18,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:46:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:18,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:21,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:21,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:21,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:21,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:21,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:21,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:46:22,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:46:22,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:46:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:22,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:26,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:37,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:37,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 294 [2018-12-03 19:46:37,414 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:37,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-03 19:46:37,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-03 19:46:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38907, Invalid=48413, Unknown=0, NotChecked=0, Total=87320 [2018-12-03 19:46:37,418 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 198 states. [2018-12-03 19:46:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:37,996 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-12-03 19:46:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 19:46:37,997 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 197 [2018-12-03 19:46:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:37,998 INFO L225 Difference]: With dead ends: 201 [2018-12-03 19:46:37,998 INFO L226 Difference]: Without dead ends: 200 [2018-12-03 19:46:37,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38220 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=38907, Invalid=48413, Unknown=0, NotChecked=0, Total=87320 [2018-12-03 19:46:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-03 19:46:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-12-03 19:46:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 19:46:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-12-03 19:46:38,005 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2018-12-03 19:46:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:38,005 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-12-03 19:46:38,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-03 19:46:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-12-03 19:46:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 19:46:38,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:38,007 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2018-12-03 19:46:38,007 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:38,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2018-12-03 19:46:38,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:46:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:38,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:41,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:41,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:41,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:41,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:41,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:41,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:46:41,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:46:41,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:46:42,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-03 19:46:42,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:46:42,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:46,749 INFO L316 TraceCheckSpWp]: Computing backward predicates...