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/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:40:08,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:40:08,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:40:08,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:40:08,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:40:08,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:40:08,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:40:08,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:40:08,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:40:08,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:40:08,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:40:08,107 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:40:08,108 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:40:08,109 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:40:08,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:40:08,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:40:08,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:40:08,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:40:08,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:40:08,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:40:08,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:40:08,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:40:08,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:40:08,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:40:08,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:40:08,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:40:08,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:40:08,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:40:08,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:40:08,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:40:08,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:40:08,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:40:08,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:40:08,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:40:08,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:40:08,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:40:08,139 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 [2019-01-11 11:40:08,160 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:40:08,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:40:08,162 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:40:08,162 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:40:08,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:40:08,162 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:40:08,163 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:40:08,163 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:40:08,163 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:40:08,163 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 11:40:08,163 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 11:40:08,164 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:40:08,164 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:40:08,164 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:40:08,165 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:40:08,166 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:40:08,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:40:08,166 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:40:08,167 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:40:08,167 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:40:08,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:40:08,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:40:08,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:40:08,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:40:08,168 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:40:08,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:40:08,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:40:08,168 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:40:08,168 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:40:08,169 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:40:08,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:40:08,169 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:40:08,169 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:40:08,169 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:40:08,170 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:40:08,170 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:40:08,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:40:08,170 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:40:08,170 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:40:08,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:40:08,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:40:08,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:40:08,238 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:40:08,239 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:40:08,240 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-01-11 11:40:08,240 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-11 11:40:08,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:40:08,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:40:08,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:40:08,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:40:08,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:40:08,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,344 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-11 11:40:08,345 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-11 11:40:08,345 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-11 11:40:08,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:40:08,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:40:08,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:40:08,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:40:08,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/1) ... [2019-01-11 11:40:08,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:40:08,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:40:08,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:40:08,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:40:08,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:40:08,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-11 11:40:08,472 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-11 11:40:08,472 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-11 11:40:08,472 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-11 11:40:08,783 INFO L278 CfgBuilder]: Using library mode [2019-01-11 11:40:08,783 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 11:40:08,785 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:40:08 BoogieIcfgContainer [2019-01-11 11:40:08,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:40:08,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:40:08,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:40:08,789 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:40:08,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:40:08" (1/2) ... [2019-01-11 11:40:08,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330c1d27 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:40:08, skipping insertion in model container [2019-01-11 11:40:08,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:40:08" (2/2) ... [2019-01-11 11:40:08,792 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-11 11:40:08,802 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:40:08,810 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-11 11:40:08,826 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-11 11:40:08,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:40:08,859 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:40:08,859 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:40:08,859 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:40:08,860 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:40:08,860 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:40:08,860 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:40:08,860 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:40:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-11 11:40:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:40:08,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:40:08,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:40:08,894 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:40:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:40:08,902 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-11 11:40:08,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:40:08,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:40:08,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:40:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:40:08,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:40:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:40:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:40:09,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:40:09,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:40:09,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:40:09,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:40:09,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:40:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:40:09,119 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-11 11:40:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:40:09,214 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-11 11:40:09,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:40:09,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:40:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:40:09,228 INFO L225 Difference]: With dead ends: 20 [2019-01-11 11:40:09,228 INFO L226 Difference]: Without dead ends: 10 [2019-01-11 11:40:09,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:40:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-11 11:40:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-11 11:40:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 11:40:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-11 11:40:09,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-11 11:40:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:40:09,267 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-11 11:40:09,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:40:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-11 11:40:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:40:09,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:40:09,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:40:09,269 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:40:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:40:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-11 11:40:09,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:40:09,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:40:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:40:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:40:09,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:40:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:40:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:40:09,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:40:09,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:40:09,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:40:09,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:40:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:40:09,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:40:09,451 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-11 11:40:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:40:09,684 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-11 11:40:09,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:40:09,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-11 11:40:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:40:09,686 INFO L225 Difference]: With dead ends: 17 [2019-01-11 11:40:09,686 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 11:40:09,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:40:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 11:40:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-11 11:40:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:40:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-11 11:40:09,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-11 11:40:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:40:09,701 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-11 11:40:09,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:40:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-11 11:40:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:40:09,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:40:09,702 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 11:40:09,703 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:40:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:40:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-11 11:40:09,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:40:09,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:40:09,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:40:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:40:09,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:40:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:40:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:40:09,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:40:09,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:40:09,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:40:09,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:40:09,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:40:09,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:40:09,763 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-11 11:40:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:40:09,803 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-11 11:40:09,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:40:09,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-11 11:40:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:40:09,805 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:40:09,805 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 11:40:09,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:40:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 11:40:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 11:40:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:40:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-11 11:40:09,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-11 11:40:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:40:09,811 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-11 11:40:09,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:40:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-11 11:40:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:40:09,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:40:09,812 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-11 11:40:09,812 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:40:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:40:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-11 11:40:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:40:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:40:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:40:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:40:09,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:40:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:40:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:40:10,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:40:10,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:40:10,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:40:10,012 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-11 11:40:10,068 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:40:10,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:41:03,906 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:41:03,908 INFO L272 AbstractInterpreter]: Visited 7 different actions 85 times. Merged at 6 different actions 78 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:41:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:03,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:41:03,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:03,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:03,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:03,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:41:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:03,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:04,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:04,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:04,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:04,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:04,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:04,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:04,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:41:04,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:04,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:41:04,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:41:04,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:41:04,435 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-01-11 11:41:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:04,638 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-11 11:41:04,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:41:04,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-11 11:41:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:04,639 INFO L225 Difference]: With dead ends: 20 [2019-01-11 11:41:04,639 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 11:41:04,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:41:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 11:41:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-11 11:41:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:41:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-11 11:41:04,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-11 11:41:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:04,649 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-11 11:41:04,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:41:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-11 11:41:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 11:41:04,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:04,650 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-11 11:41:04,651 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-01-11 11:41:04,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:04,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:04,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:04,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:04,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:04,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:04,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:04,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:04,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:04,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:41:04,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:41:04,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:41:04,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:04,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:04,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:04,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:05,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:05,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:05,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:05,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:05,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:41:05,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:05,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:41:05,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:41:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:41:05,347 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-01-11 11:41:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:05,574 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-11 11:41:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:41:05,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-11 11:41:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:05,577 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:41:05,577 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:41:05,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:41:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:41:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-11 11:41:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:41:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-11 11:41:05,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-11 11:41:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:05,583 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-11 11:41:05,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:41:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-11 11:41:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 11:41:05,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:05,584 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-11 11:41:05,584 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:05,585 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-01-11 11:41:05,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:05,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:05,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:05,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:05,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:05,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:05,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:05,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:05,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:05,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:05,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:05,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:41:05,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:41:05,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:41:05,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:05,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:05,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:05,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:05,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:05,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:05,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:06,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:06,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:41:06,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:06,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:41:06,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:41:06,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:41:06,066 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-11 11:41:06,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:06,249 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-11 11:41:06,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:41:06,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-11 11:41:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:06,252 INFO L225 Difference]: With dead ends: 30 [2019-01-11 11:41:06,253 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 11:41:06,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:41:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 11:41:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-11 11:41:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:41:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-11 11:41:06,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-11 11:41:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:06,258 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-11 11:41:06,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:41:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-11 11:41:06,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 11:41:06,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:06,259 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-11 11:41:06,260 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:06,260 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-01-11 11:41:06,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:06,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:06,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:06,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:06,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:06,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:06,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:06,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:06,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:06,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:06,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:06,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:41:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:06,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:06,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:06,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:06,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:06,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:06,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:06,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:06,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:41:06,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:06,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:41:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:41:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:41:06,940 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-01-11 11:41:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:07,240 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-11 11:41:07,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:41:07,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-11 11:41:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:07,243 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:41:07,243 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 11:41:07,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:41:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 11:41:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-11 11:41:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:41:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-11 11:41:07,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-11 11:41:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:07,252 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-11 11:41:07,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:41:07,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-11 11:41:07,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 11:41:07,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:07,253 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-11 11:41:07,253 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:07,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-01-11 11:41:07,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:07,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:07,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:07,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:07,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:07,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:07,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:07,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:07,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:07,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:07,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:07,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:41:07,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:41:07,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 11:41:07,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:07,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:07,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:07,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:07,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:07,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:07,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:07,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:07,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-11 11:41:07,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:07,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 11:41:07,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 11:41:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:41:07,862 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-11 11:41:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:08,287 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-11 11:41:08,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:41:08,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-11 11:41:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:08,289 INFO L225 Difference]: With dead ends: 40 [2019-01-11 11:41:08,289 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 11:41:08,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:41:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 11:41:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-11 11:41:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:41:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-11 11:41:08,296 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-11 11:41:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:08,296 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-11 11:41:08,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 11:41:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-11 11:41:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 11:41:08,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:08,298 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-11 11:41:08,298 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-01-11 11:41:08,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:08,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:08,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:08,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:08,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:08,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:08,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:08,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:08,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:08,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:41:08,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:41:08,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:41:08,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:08,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:08,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:08,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:08,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:08,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:08,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:09,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:09,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-11 11:41:09,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:09,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 11:41:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 11:41:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:41:09,073 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-01-11 11:41:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:09,345 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-11 11:41:09,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:41:09,354 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-11 11:41:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:09,355 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:41:09,355 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:41:09,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:41:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:41:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-11 11:41:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:41:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-11 11:41:09,362 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-11 11:41:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:09,363 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-11 11:41:09,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 11:41:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-11 11:41:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 11:41:09,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:09,364 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-11 11:41:09,364 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-01-11 11:41:09,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:09,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:09,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:09,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:09,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:09,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:09,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:09,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:09,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:09,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:09,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:09,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:09,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:41:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:09,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:09,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:09,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:09,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:09,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:09,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:10,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:10,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-11 11:41:10,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:10,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 11:41:10,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 11:41:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:41:10,271 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-01-11 11:41:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:10,664 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-11 11:41:10,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:41:10,665 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-01-11 11:41:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:10,666 INFO L225 Difference]: With dead ends: 50 [2019-01-11 11:41:10,666 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 11:41:10,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:41:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 11:41:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-11 11:41:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 11:41:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-11 11:41:10,674 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-11 11:41:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:10,675 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-11 11:41:10,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 11:41:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-11 11:41:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-11 11:41:10,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:10,676 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-11 11:41:10,676 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-01-11 11:41:10,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:10,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:10,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:11,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:11,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:11,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:11,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:11,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:11,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:11,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:41:11,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:41:11,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 11:41:11,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:11,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:11,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:11,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:11,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:11,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:11,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:11,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:11,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-11 11:41:11,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:11,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 11:41:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 11:41:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:41:11,950 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-01-11 11:41:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:12,282 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-11 11:41:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:41:12,282 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-11 11:41:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:12,284 INFO L225 Difference]: With dead ends: 55 [2019-01-11 11:41:12,284 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 11:41:12,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 11:41:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 11:41:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-11 11:41:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:41:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-11 11:41:12,292 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-11 11:41:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:12,292 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-11 11:41:12,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 11:41:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-11 11:41:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 11:41:12,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:12,294 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-11 11:41:12,294 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-01-11 11:41:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:12,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:12,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:13,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:13,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:13,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:13,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:13,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:13,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:13,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:41:13,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:41:13,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:41:13,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:13,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:13,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:13,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:13,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:13,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:13,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:13,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:13,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-11 11:41:13,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:13,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 11:41:13,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 11:41:13,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:41:13,719 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-01-11 11:41:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:14,132 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-11 11:41:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:41:14,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-01-11 11:41:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:14,133 INFO L225 Difference]: With dead ends: 60 [2019-01-11 11:41:14,133 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 11:41:14,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:41:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 11:41:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-01-11 11:41:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 11:41:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-11 11:41:14,142 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-11 11:41:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:14,142 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-11 11:41:14,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 11:41:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-11 11:41:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 11:41:14,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:14,144 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-11 11:41:14,144 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-01-11 11:41:14,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:14,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:14,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:14,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:14,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:14,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:14,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:14,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:14,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:14,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:14,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:41:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:14,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:14,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:14,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:14,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:14,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:14,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:15,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-11 11:41:15,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:15,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 11:41:15,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 11:41:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:41:15,063 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-01-11 11:41:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:15,574 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-11 11:41:15,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:41:15,575 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-11 11:41:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:15,576 INFO L225 Difference]: With dead ends: 65 [2019-01-11 11:41:15,576 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 11:41:15,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:41:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 11:41:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-11 11:41:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:41:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-11 11:41:15,588 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-11 11:41:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:15,589 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-11 11:41:15,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 11:41:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-11 11:41:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 11:41:15,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:15,590 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-11 11:41:15,590 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-01-11 11:41:15,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:15,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:15,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:15,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:15,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:15,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:15,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:15,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:15,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:15,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:15,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:15,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:41:15,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:41:15,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-11 11:41:15,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:15,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:15,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:15,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:15,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:15,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:16,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:16,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:16,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-11 11:41:16,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:16,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 11:41:16,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 11:41:16,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:41:16,615 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-01-11 11:41:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:17,129 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-11 11:41:17,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:41:17,130 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-01-11 11:41:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:17,131 INFO L225 Difference]: With dead ends: 70 [2019-01-11 11:41:17,131 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 11:41:17,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:41:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 11:41:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-11 11:41:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 11:41:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-11 11:41:17,142 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-11 11:41:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:17,143 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-11 11:41:17,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 11:41:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-11 11:41:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-11 11:41:17,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:17,144 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-11 11:41:17,144 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-01-11 11:41:17,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:17,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:17,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:17,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:17,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:17,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:17,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:17,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:17,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:17,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:17,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:17,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:41:17,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:41:17,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:41:17,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:17,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:17,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:17,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:17,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:17,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:18,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:18,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:18,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-11 11:41:18,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:18,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 11:41:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 11:41:18,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:41:18,722 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-01-11 11:41:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:19,456 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-11 11:41:19,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 11:41:19,457 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-01-11 11:41:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:19,458 INFO L225 Difference]: With dead ends: 75 [2019-01-11 11:41:19,458 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 11:41:19,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 11:41:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 11:41:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-11 11:41:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:41:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-11 11:41:19,471 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-11 11:41:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:19,472 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-11 11:41:19,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 11:41:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-11 11:41:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 11:41:19,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:19,473 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-11 11:41:19,473 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-01-11 11:41:19,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:19,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:19,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:19,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:19,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:19,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:19,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:19,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:19,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:20,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:20,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:41:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:20,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:20,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:20,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:20,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:20,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:20,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:21,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:21,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-11 11:41:21,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 11:41:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 11:41:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:41:21,480 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-01-11 11:41:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:22,082 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-11 11:41:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 11:41:22,082 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-01-11 11:41:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:22,083 INFO L225 Difference]: With dead ends: 80 [2019-01-11 11:41:22,083 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 11:41:22,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:41:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 11:41:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-11 11:41:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 11:41:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-11 11:41:22,096 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-11 11:41:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:22,096 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-11 11:41:22,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 11:41:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-11 11:41:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-11 11:41:22,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:22,097 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-11 11:41:22,098 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-01-11 11:41:22,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:22,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:22,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:22,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:22,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:22,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:22,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:22,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:22,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:22,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:41:22,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:41:22,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 11:41:22,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:22,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:22,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:22,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:22,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:22,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:22,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:23,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:23,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-11 11:41:23,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:23,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 11:41:23,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 11:41:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:41:23,433 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-01-11 11:41:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:24,116 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-11 11:41:24,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:41:24,117 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-01-11 11:41:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:24,118 INFO L225 Difference]: With dead ends: 85 [2019-01-11 11:41:24,118 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 11:41:24,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 11:41:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 11:41:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-11 11:41:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 11:41:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-11 11:41:24,132 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-11 11:41:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:24,132 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-11 11:41:24,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 11:41:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-11 11:41:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 11:41:24,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:24,134 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-11 11:41:24,134 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-01-11 11:41:24,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:24,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:24,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:24,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:24,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:24,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:24,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:24,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:24,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:24,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:24,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:24,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:41:24,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:41:24,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:41:24,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:24,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:24,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:24,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:24,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:24,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:26,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:27,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:27,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-11 11:41:27,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:27,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 11:41:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 11:41:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:41:27,021 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-01-11 11:41:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:27,680 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-11 11:41:27,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:41:27,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-01-11 11:41:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:27,681 INFO L225 Difference]: With dead ends: 90 [2019-01-11 11:41:27,681 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:41:27,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:41:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:41:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-11 11:41:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-11 11:41:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-11 11:41:27,695 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-11 11:41:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:27,695 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-11 11:41:27,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 11:41:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-11 11:41:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 11:41:27,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:27,696 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-11 11:41:27,696 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-01-11 11:41:27,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:27,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:27,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:27,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:28,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:28,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:28,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:28,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:28,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:28,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:28,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:28,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:41:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:28,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:28,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:28,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:28,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:28,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:29,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:30,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:30,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-11 11:41:30,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:30,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 11:41:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 11:41:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:41:30,003 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-01-11 11:41:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:30,644 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-11 11:41:30,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 11:41:30,645 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-01-11 11:41:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:30,646 INFO L225 Difference]: With dead ends: 95 [2019-01-11 11:41:30,646 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 11:41:30,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:41:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 11:41:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-11 11:41:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:41:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-11 11:41:30,657 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-11 11:41:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:30,657 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-11 11:41:30,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 11:41:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-11 11:41:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 11:41:30,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:30,658 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-11 11:41:30,658 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-01-11 11:41:30,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:30,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:30,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:30,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:30,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:31,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:31,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:31,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:31,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:31,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:31,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:31,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:41:31,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:41:31,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 11:41:31,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:31,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:31,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:31,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:31,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:31,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:32,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:32,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:32,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-11 11:41:32,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:32,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 11:41:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 11:41:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:41:32,980 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-01-11 11:41:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:33,688 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-11 11:41:33,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 11:41:33,689 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-01-11 11:41:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:33,690 INFO L225 Difference]: With dead ends: 100 [2019-01-11 11:41:33,690 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 11:41:33,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:41:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 11:41:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-11 11:41:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 11:41:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-11 11:41:33,701 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-11 11:41:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:33,701 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-11 11:41:33,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 11:41:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-11 11:41:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 11:41:33,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:33,702 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-11 11:41:33,702 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-01-11 11:41:33,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:33,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:33,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:34,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:34,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:34,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:34,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:34,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:34,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:34,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:41:34,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:41:34,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:41:34,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:34,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:34,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:34,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:34,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:34,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:34,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:35,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:35,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-11 11:41:35,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:35,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 11:41:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 11:41:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:41:35,610 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-01-11 11:41:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:36,346 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-11 11:41:36,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 11:41:36,347 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-01-11 11:41:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:36,348 INFO L225 Difference]: With dead ends: 105 [2019-01-11 11:41:36,348 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 11:41:36,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 11:41:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 11:41:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-01-11 11:41:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:41:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-11 11:41:36,359 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-11 11:41:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:36,359 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-11 11:41:36,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 11:41:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-11 11:41:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 11:41:36,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:36,360 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-11 11:41:36,360 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-01-11 11:41:36,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:36,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:36,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:36,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:36,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:37,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:37,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:37,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:37,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:37,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:37,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:37,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:37,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:41:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:37,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:37,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:37,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:37,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:37,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:37,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:38,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:38,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-11 11:41:38,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:38,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 11:41:38,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 11:41:38,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 11:41:38,816 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-01-11 11:41:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:39,794 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-11 11:41:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 11:41:39,795 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-01-11 11:41:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:39,796 INFO L225 Difference]: With dead ends: 110 [2019-01-11 11:41:39,796 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 11:41:39,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:41:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 11:41:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-11 11:41:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 11:41:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-11 11:41:39,808 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-11 11:41:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:39,808 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-11 11:41:39,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 11:41:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-11 11:41:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 11:41:39,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:39,809 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-11 11:41:39,809 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-01-11 11:41:39,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:39,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:39,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:39,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:40,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:40,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:40,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:40,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:40,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:40,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:40,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:41:40,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:41:40,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-11 11:41:40,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:40,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:40,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:40,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:40,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:40,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:40,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:42,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:42,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-11 11:41:42,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:42,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 11:41:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 11:41:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 11:41:42,224 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-01-11 11:41:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:43,110 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-11 11:41:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 11:41:43,110 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-01-11 11:41:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:43,111 INFO L225 Difference]: With dead ends: 115 [2019-01-11 11:41:43,111 INFO L226 Difference]: Without dead ends: 114 [2019-01-11 11:41:43,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 11:41:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-11 11:41:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-11 11:41:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 11:41:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-11 11:41:43,125 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-11 11:41:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:43,125 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-11 11:41:43,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 11:41:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-11 11:41:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 11:41:43,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:43,126 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-11 11:41:43,126 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-01-11 11:41:43,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:43,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:43,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:44,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:44,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:44,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:44,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:44,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:44,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:44,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:41:44,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:41:44,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:41:44,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:44,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:44,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:44,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:44,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:44,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:44,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:45,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:45,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-11 11:41:45,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:45,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 11:41:45,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 11:41:45,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:41:45,900 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-01-11 11:41:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:46,872 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-11 11:41:46,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:41:46,872 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-01-11 11:41:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:46,874 INFO L225 Difference]: With dead ends: 120 [2019-01-11 11:41:46,874 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 11:41:46,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:41:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 11:41:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-01-11 11:41:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 11:41:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-11 11:41:46,894 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-11 11:41:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:46,894 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-11 11:41:46,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 11:41:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-11 11:41:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-11 11:41:46,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:46,895 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-11 11:41:46,895 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-01-11 11:41:46,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:46,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:46,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:46,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:46,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:47,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:47,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:47,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:47,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:47,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:47,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:47,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:47,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:41:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:47,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:47,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:47,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:47,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:47,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:48,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:49,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:49,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-11 11:41:49,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:49,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 11:41:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 11:41:49,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:41:49,318 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-01-11 11:41:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:50,528 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-01-11 11:41:50,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:41:50,528 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-01-11 11:41:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:50,530 INFO L225 Difference]: With dead ends: 125 [2019-01-11 11:41:50,530 INFO L226 Difference]: Without dead ends: 124 [2019-01-11 11:41:50,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:41:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-11 11:41:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-01-11 11:41:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 11:41:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-11 11:41:50,545 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-11 11:41:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:50,545 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-11 11:41:50,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 11:41:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-11 11:41:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 11:41:50,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:50,546 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-11 11:41:50,546 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-01-11 11:41:50,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:50,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:50,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:51,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:51,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:51,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:51,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:51,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:51,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:51,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:41:51,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:41:52,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 11:41:52,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:52,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:52,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:52,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:52,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:52,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:52,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:53,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:53,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-11 11:41:53,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:53,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 11:41:53,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 11:41:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 11:41:53,943 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-01-11 11:41:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:55,201 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-11 11:41:55,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 11:41:55,201 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-01-11 11:41:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:55,202 INFO L225 Difference]: With dead ends: 130 [2019-01-11 11:41:55,202 INFO L226 Difference]: Without dead ends: 129 [2019-01-11 11:41:55,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:41:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-11 11:41:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-01-11 11:41:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-11 11:41:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-11 11:41:55,218 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-11 11:41:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:55,218 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-11 11:41:55,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 11:41:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-11 11:41:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-11 11:41:55,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:55,219 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-11 11:41:55,220 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-01-11 11:41:55,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:55,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:55,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:55,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:55,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:55,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:55,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:55,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:55,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:55,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:55,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:55,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:41:55,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:41:55,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:41:55,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:41:55,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:41:55,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:41:55,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:41:56,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:41:56,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:41:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:56,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:41:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:58,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:41:58,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-11 11:41:58,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:41:58,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 11:41:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 11:41:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:41:58,019 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-01-11 11:41:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:41:59,087 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-11 11:41:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 11:41:59,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-01-11 11:41:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:41:59,089 INFO L225 Difference]: With dead ends: 135 [2019-01-11 11:41:59,089 INFO L226 Difference]: Without dead ends: 134 [2019-01-11 11:41:59,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:41:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-11 11:41:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-01-11 11:41:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-11 11:41:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-11 11:41:59,109 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-11 11:41:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:41:59,109 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-11 11:41:59,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 11:41:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-11 11:41:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-11 11:41:59,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:41:59,110 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-11 11:41:59,110 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:41:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:41:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-01-11 11:41:59,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:41:59,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:59,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:41:59,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:41:59,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:41:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:41:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:41:59,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:59,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:41:59,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:41:59,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:41:59,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:41:59,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:41:59,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:41:59,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:42:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:00,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:00,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:00,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:00,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:00,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:00,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:02,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:02,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-11 11:42:02,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:02,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-11 11:42:02,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-11 11:42:02,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-01-11 11:42:02,277 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-01-11 11:42:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:03,509 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-11 11:42:03,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 11:42:03,509 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-01-11 11:42:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:03,510 INFO L225 Difference]: With dead ends: 140 [2019-01-11 11:42:03,510 INFO L226 Difference]: Without dead ends: 139 [2019-01-11 11:42:03,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:42:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-11 11:42:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-01-11 11:42:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-11 11:42:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-11 11:42:03,531 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-11 11:42:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:03,531 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-11 11:42:03,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-11 11:42:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-11 11:42:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-11 11:42:03,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:03,532 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-11 11:42:03,533 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:03,533 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-01-11 11:42:03,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:03,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:42:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:03,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:04,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:04,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:04,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:04,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:04,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:04,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:04,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:42:04,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:42:04,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 11:42:04,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:42:04,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:04,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:04,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:04,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:04,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:05,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:07,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:07,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-11 11:42:07,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:07,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 11:42:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 11:42:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:42:07,437 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-01-11 11:42:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:08,665 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-01-11 11:42:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:42:08,666 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-01-11 11:42:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:08,667 INFO L225 Difference]: With dead ends: 145 [2019-01-11 11:42:08,667 INFO L226 Difference]: Without dead ends: 144 [2019-01-11 11:42:08,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 11:42:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-11 11:42:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-01-11 11:42:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-11 11:42:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-11 11:42:08,686 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-11 11:42:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:08,686 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-11 11:42:08,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 11:42:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-11 11:42:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-11 11:42:08,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:08,688 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-11 11:42:08,688 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:08,688 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-01-11 11:42:08,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:08,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:08,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:42:08,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:08,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:09,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:09,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:09,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:09,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:09,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:09,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:09,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:42:09,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:42:09,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:42:09,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:42:09,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:09,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:09,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:09,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:09,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:10,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:12,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:12,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-11 11:42:12,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:12,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-11 11:42:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-11 11:42:12,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 11:42:12,655 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-01-11 11:42:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:13,997 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-11 11:42:13,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:42:13,997 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-01-11 11:42:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:13,998 INFO L225 Difference]: With dead ends: 150 [2019-01-11 11:42:13,998 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 11:42:14,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:42:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 11:42:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-11 11:42:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-11 11:42:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-11 11:42:14,017 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-11 11:42:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:14,018 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-11 11:42:14,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-11 11:42:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-11 11:42:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-11 11:42:14,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:14,018 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-11 11:42:14,019 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-01-11 11:42:14,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:14,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:14,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:42:14,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:14,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:14,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:14,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:14,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:14,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:14,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:14,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:14,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:42:14,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:42:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:14,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:14,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:14,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:14,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:14,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:15,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:17,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:17,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-11 11:42:17,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:17,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-11 11:42:17,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-11 11:42:17,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:42:17,857 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-01-11 11:42:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:19,173 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-11 11:42:19,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 11:42:19,174 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-01-11 11:42:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:19,174 INFO L225 Difference]: With dead ends: 155 [2019-01-11 11:42:19,175 INFO L226 Difference]: Without dead ends: 154 [2019-01-11 11:42:19,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:42:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-11 11:42:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-01-11 11:42:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-11 11:42:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-11 11:42:19,195 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-11 11:42:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:19,196 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-11 11:42:19,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-11 11:42:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-11 11:42:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-11 11:42:19,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:19,196 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-11 11:42:19,197 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:19,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:19,197 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-01-11 11:42:19,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:19,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:19,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:42:19,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:19,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:20,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:20,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:20,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:20,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:20,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:20,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:20,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:42:20,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:42:21,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-11 11:42:21,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:42:21,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:21,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:21,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:21,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:21,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:22,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:24,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:24,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-11 11:42:24,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:24,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 11:42:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 11:42:24,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:42:24,608 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-01-11 11:42:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:26,219 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-01-11 11:42:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 11:42:26,219 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-01-11 11:42:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:26,220 INFO L225 Difference]: With dead ends: 160 [2019-01-11 11:42:26,220 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 11:42:26,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:42:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 11:42:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-01-11 11:42:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-11 11:42:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-11 11:42:26,247 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-11 11:42:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:26,248 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-11 11:42:26,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 11:42:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-11 11:42:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-11 11:42:26,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:26,249 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-11 11:42:26,249 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-01-11 11:42:26,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:26,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:42:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:26,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:27,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:27,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:27,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:27,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:27,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:27,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:27,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:42:27,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:42:27,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:42:27,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:42:27,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:27,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:27,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:28,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:28,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:28,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:31,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:31,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-11 11:42:31,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:31,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-11 11:42:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-11 11:42:31,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:42:31,367 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-01-11 11:42:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:32,885 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-11 11:42:32,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:42:32,885 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-01-11 11:42:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:32,886 INFO L225 Difference]: With dead ends: 165 [2019-01-11 11:42:32,886 INFO L226 Difference]: Without dead ends: 164 [2019-01-11 11:42:32,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:42:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-11 11:42:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-11 11:42:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-11 11:42:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-11 11:42:32,913 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-01-11 11:42:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:32,913 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-11 11:42:32,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-11 11:42:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-11 11:42:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-11 11:42:32,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:32,915 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-01-11 11:42:32,915 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-01-11 11:42:32,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:32,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:42:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:32,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:34,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:34,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:34,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:34,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:34,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:34,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:34,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:42:34,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:42:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:34,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:34,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:34,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:34,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:34,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:35,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:37,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:37,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-11 11:42:37,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:37,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-11 11:42:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-11 11:42:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:42:37,544 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-01-11 11:42:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:39,595 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-01-11 11:42:39,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 11:42:39,595 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-01-11 11:42:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:39,596 INFO L225 Difference]: With dead ends: 170 [2019-01-11 11:42:39,596 INFO L226 Difference]: Without dead ends: 169 [2019-01-11 11:42:39,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:42:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-11 11:42:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-01-11 11:42:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-11 11:42:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-11 11:42:39,626 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-01-11 11:42:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:39,627 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-11 11:42:39,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-11 11:42:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-11 11:42:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-11 11:42:39,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:39,628 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-01-11 11:42:39,628 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-01-11 11:42:39,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:39,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:42:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:39,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:40,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:40,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:40,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:40,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:40,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:40,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:40,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:42:40,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:42:41,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-11 11:42:41,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:42:41,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:41,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:41,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:41,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:41,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:42,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:44,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:44,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-11 11:42:44,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:44,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 11:42:44,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 11:42:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:42:44,603 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-01-11 11:42:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:46,534 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-11 11:42:46,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:42:46,534 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-01-11 11:42:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:46,535 INFO L225 Difference]: With dead ends: 175 [2019-01-11 11:42:46,535 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 11:42:46,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 11:42:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 11:42:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-01-11 11:42:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 11:42:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-01-11 11:42:46,572 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-01-11 11:42:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:46,572 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-01-11 11:42:46,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 11:42:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-01-11 11:42:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-11 11:42:46,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:46,573 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-01-11 11:42:46,574 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:46,574 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-01-11 11:42:46,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:46,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:42:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:46,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:47,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:47,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:47,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:47,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:47,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:47,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:47,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:42:47,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:42:48,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:42:48,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:42:48,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:48,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:48,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:48,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:48,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:49,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:51,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:51,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-11 11:42:51,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:51,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-11 11:42:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-11 11:42:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:42:51,903 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-01-11 11:42:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:42:53,742 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-11 11:42:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 11:42:53,742 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-01-11 11:42:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:42:53,743 INFO L225 Difference]: With dead ends: 180 [2019-01-11 11:42:53,743 INFO L226 Difference]: Without dead ends: 179 [2019-01-11 11:42:53,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:42:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-11 11:42:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-01-11 11:42:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-11 11:42:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-11 11:42:53,774 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-01-11 11:42:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:42:53,774 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-11 11:42:53,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-11 11:42:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-11 11:42:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-11 11:42:53,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:42:53,775 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-01-11 11:42:53,776 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:42:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:42:53,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-01-11 11:42:53,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:42:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:53,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:42:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:42:53,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:42:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:55,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:55,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:42:55,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:42:55,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:42:55,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:42:55,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:42:55,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:42:55,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:42:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:42:55,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:42:55,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:42:55,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:42:55,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:42:55,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:42:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:56,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:42:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:42:59,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:42:59,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-11 11:42:59,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:42:59,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 11:42:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 11:42:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:42:59,598 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-01-11 11:43:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:01,614 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-01-11 11:43:01,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:43:01,615 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-01-11 11:43:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:01,616 INFO L225 Difference]: With dead ends: 185 [2019-01-11 11:43:01,617 INFO L226 Difference]: Without dead ends: 184 [2019-01-11 11:43:01,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:43:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-11 11:43:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-01-11 11:43:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-11 11:43:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-11 11:43:01,647 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-01-11 11:43:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:01,647 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-11 11:43:01,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 11:43:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-11 11:43:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-11 11:43:01,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:01,649 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-01-11 11:43:01,649 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:43:01,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:01,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-01-11 11:43:01,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:01,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:01,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:01,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:01,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:02,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:02,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:02,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:43:02,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:43:02,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:02,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:43:02,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:43:02,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:43:03,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-11 11:43:03,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:43:03,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:03,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:43:03,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:03,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:03,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:43:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:04,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:07,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:07,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-11 11:43:07,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:07,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 11:43:07,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 11:43:07,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 11:43:07,254 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-01-11 11:43:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:09,049 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-01-11 11:43:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 11:43:09,049 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-01-11 11:43:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:09,050 INFO L225 Difference]: With dead ends: 190 [2019-01-11 11:43:09,050 INFO L226 Difference]: Without dead ends: 189 [2019-01-11 11:43:09,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:43:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-11 11:43:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-01-11 11:43:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 11:43:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-01-11 11:43:09,086 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-01-11 11:43:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:09,087 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-01-11 11:43:09,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 11:43:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-01-11 11:43:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-11 11:43:09,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:09,087 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-01-11 11:43:09,088 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:43:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-01-11 11:43:09,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:09,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:09,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:43:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:09,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:10,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:10,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:10,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:43:10,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:43:10,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:10,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:43:10,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:43:10,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:43:10,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:43:10,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:43:10,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:10,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:43:10,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:10,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:10,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:43:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:12,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:15,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:15,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-11 11:43:15,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:15,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-11 11:43:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-11 11:43:15,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:43:15,429 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-01-11 11:43:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:17,520 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-11 11:43:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 11:43:17,520 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-01-11 11:43:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:17,522 INFO L225 Difference]: With dead ends: 195 [2019-01-11 11:43:17,522 INFO L226 Difference]: Without dead ends: 194 [2019-01-11 11:43:17,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:43:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-11 11:43:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-01-11 11:43:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-11 11:43:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-01-11 11:43:17,556 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-01-11 11:43:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:17,556 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-01-11 11:43:17,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-11 11:43:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-01-11 11:43:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-11 11:43:17,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:17,558 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-01-11 11:43:17,558 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:43:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-01-11 11:43:17,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:17,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:17,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:43:17,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:17,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:18,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:18,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:18,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:43:18,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:43:18,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:18,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:43:18,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:18,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:18,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:18,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:43:18,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:18,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:18,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:43:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:20,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:23,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:23,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-11 11:43:23,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:23,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 11:43:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 11:43:23,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 11:43:23,516 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-01-11 11:43:24,170 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-11 11:43:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:25,977 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-01-11 11:43:25,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 11:43:25,977 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-01-11 11:43:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:25,979 INFO L225 Difference]: With dead ends: 200 [2019-01-11 11:43:25,979 INFO L226 Difference]: Without dead ends: 199 [2019-01-11 11:43:25,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:43:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-11 11:43:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-01-11 11:43:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-11 11:43:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-11 11:43:26,043 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-01-11 11:43:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:26,043 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-11 11:43:26,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 11:43:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-11 11:43:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-11 11:43:26,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:26,044 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-01-11 11:43:26,044 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:43:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-01-11 11:43:26,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:26,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:26,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:27,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:27,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:27,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:43:27,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:43:27,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:27,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:43:27,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:43:27,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:43:27,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-11 11:43:27,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:43:27,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:27,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:43:27,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:27,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:27,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:43:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:29,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:32,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:32,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-11 11:43:32,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:32,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 11:43:32,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 11:43:32,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:43:32,714 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-01-11 11:43:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:34,845 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-01-11 11:43:34,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 11:43:34,845 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-01-11 11:43:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:34,846 INFO L225 Difference]: With dead ends: 205 [2019-01-11 11:43:34,846 INFO L226 Difference]: Without dead ends: 204 [2019-01-11 11:43:34,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:43:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-11 11:43:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-01-11 11:43:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-11 11:43:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-11 11:43:34,878 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-01-11 11:43:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:34,878 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-11 11:43:34,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 11:43:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-11 11:43:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-11 11:43:34,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:34,879 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-01-11 11:43:34,879 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:43:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:34,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-01-11 11:43:34,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:34,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:34,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:43:34,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:34,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:36,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:36,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:36,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:43:36,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:43:36,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:36,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:43:36,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:43:36,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:43:36,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:43:36,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:43:36,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:36,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:43:36,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:36,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:36,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:43:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:37,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:41,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:41,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-11 11:43:41,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:41,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-11 11:43:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-11 11:43:41,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 11:43:41,426 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-01-11 11:43:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:43,708 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-11 11:43:43,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:43:43,708 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-01-11 11:43:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:43,709 INFO L225 Difference]: With dead ends: 210 [2019-01-11 11:43:43,709 INFO L226 Difference]: Without dead ends: 209 [2019-01-11 11:43:43,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:43:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-11 11:43:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-01-11 11:43:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-11 11:43:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-11 11:43:43,740 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-01-11 11:43:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:43,740 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-11 11:43:43,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-11 11:43:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-11 11:43:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-11 11:43:43,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:43,741 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-01-11 11:43:43,741 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:43:43,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:43,742 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-01-11 11:43:43,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:43,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:43:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:43,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:45,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:45,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:45,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:43:45,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:43:45,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:45,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:43:45,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:45,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:43:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:45,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:45,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:43:45,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:45,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:43:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:46,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:43:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:50,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:43:50,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-11 11:43:50,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:43:50,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 11:43:50,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 11:43:50,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:43:50,762 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-01-11 11:43:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:43:53,166 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-11 11:43:53,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 11:43:53,167 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-01-11 11:43:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:43:53,168 INFO L225 Difference]: With dead ends: 215 [2019-01-11 11:43:53,168 INFO L226 Difference]: Without dead ends: 214 [2019-01-11 11:43:53,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:43:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-11 11:43:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-01-11 11:43:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-11 11:43:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-11 11:43:53,209 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-01-11 11:43:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:43:53,209 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-11 11:43:53,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 11:43:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-11 11:43:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-11 11:43:53,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:43:53,210 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-01-11 11:43:53,211 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:43:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:43:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-01-11 11:43:53,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:43:53,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:53,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:43:53,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:43:53,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:43:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:43:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:55,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:55,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:43:55,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:43:55,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:43:55,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:43:55,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:43:55,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:43:55,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:43:55,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-11 11:43:55,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:43:55,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:43:55,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:43:55,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:43:55,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:43:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:43:56,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:01,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:01,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-11 11:44:01,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:01,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 11:44:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 11:44:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-01-11 11:44:01,005 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-01-11 11:44:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:03,458 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-01-11 11:44:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 11:44:03,458 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-01-11 11:44:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:03,459 INFO L225 Difference]: With dead ends: 220 [2019-01-11 11:44:03,459 INFO L226 Difference]: Without dead ends: 219 [2019-01-11 11:44:03,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:44:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-11 11:44:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-01-11 11:44:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-11 11:44:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-01-11 11:44:03,495 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-01-11 11:44:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:03,495 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-01-11 11:44:03,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 11:44:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-01-11 11:44:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-11 11:44:03,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:03,496 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-01-11 11:44:03,496 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:44:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-01-11 11:44:03,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:03,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:44:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:03,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:05,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:05,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:05,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:05,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:05,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:05,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:05,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:44:05,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:44:05,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:44:05,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:44:05,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:05,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:44:05,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:05,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:05,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:44:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:06,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:11,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-11 11:44:11,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:11,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-11 11:44:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-11 11:44:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:44:11,201 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-01-11 11:44:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:13,762 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-11 11:44:13,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:44:13,763 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-01-11 11:44:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:13,764 INFO L225 Difference]: With dead ends: 225 [2019-01-11 11:44:13,764 INFO L226 Difference]: Without dead ends: 224 [2019-01-11 11:44:13,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:44:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-11 11:44:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-01-11 11:44:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:44:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-11 11:44:13,801 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-01-11 11:44:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:13,801 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-11 11:44:13,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-11 11:44:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-11 11:44:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-11 11:44:13,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:13,802 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-01-11 11:44:13,802 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:44:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:13,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-01-11 11:44:13,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:13,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:44:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:13,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:15,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:15,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:15,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:15,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:15,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:15,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:15,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:15,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:15,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:15,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:44:15,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:15,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:44:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:17,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:21,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:21,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-11 11:44:21,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 11:44:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 11:44:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-01-11 11:44:21,522 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-01-11 11:44:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:24,267 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-01-11 11:44:24,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 11:44:24,267 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-01-11 11:44:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:24,268 INFO L225 Difference]: With dead ends: 230 [2019-01-11 11:44:24,268 INFO L226 Difference]: Without dead ends: 229 [2019-01-11 11:44:24,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:44:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-11 11:44:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-11 11:44:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-11 11:44:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-11 11:44:24,318 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-01-11 11:44:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:24,318 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-11 11:44:24,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 11:44:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-11 11:44:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-11 11:44:24,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:24,319 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-01-11 11:44:24,319 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:44:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-01-11 11:44:24,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:24,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:24,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:24,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:24,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:25,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:25,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:25,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:25,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:25,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:25,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:25,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:44:25,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:44:26,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-11 11:44:26,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:44:26,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:26,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:44:26,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:26,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:26,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:44:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:27,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:32,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:32,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-11 11:44:32,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:32,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 11:44:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 11:44:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:44:32,592 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-01-11 11:44:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:35,328 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-11 11:44:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 11:44:35,328 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-01-11 11:44:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:35,329 INFO L225 Difference]: With dead ends: 235 [2019-01-11 11:44:35,329 INFO L226 Difference]: Without dead ends: 234 [2019-01-11 11:44:35,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:44:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-11 11:44:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-01-11 11:44:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-11 11:44:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-01-11 11:44:35,396 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-01-11 11:44:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:35,396 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-01-11 11:44:35,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 11:44:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-01-11 11:44:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 11:44:35,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:35,398 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-01-11 11:44:35,398 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:44:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-01-11 11:44:35,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:35,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:35,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:44:35,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:35,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:37,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:37,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:37,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:37,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:37,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:37,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:37,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:44:37,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:44:37,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:44:37,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:44:37,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:37,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:44:37,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:37,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:37,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:44:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:39,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:43,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:43,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-11 11:44:43,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:43,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-11 11:44:43,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-11 11:44:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-01-11 11:44:43,965 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-01-11 11:44:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:46,680 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-11 11:44:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:44:46,681 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-01-11 11:44:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:46,682 INFO L225 Difference]: With dead ends: 240 [2019-01-11 11:44:46,682 INFO L226 Difference]: Without dead ends: 239 [2019-01-11 11:44:46,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:44:46,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-11 11:44:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-01-11 11:44:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-11 11:44:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-01-11 11:44:46,743 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-01-11 11:44:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:46,744 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-01-11 11:44:46,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-11 11:44:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-01-11 11:44:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-11 11:44:46,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:46,745 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-01-11 11:44:46,745 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:44:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-01-11 11:44:46,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:46,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:46,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:44:46,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:46,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:48,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:48,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:48,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:44:48,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:44:48,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:48,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:48,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:48,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:48,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:48,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:44:48,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:44:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:50,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:55,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:55,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-11 11:44:55,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:55,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-11 11:44:55,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-11 11:44:55,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:44:55,698 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-01-11 11:44:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:58,594 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-01-11 11:44:58,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 11:44:58,600 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-01-11 11:44:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:58,601 INFO L225 Difference]: With dead ends: 245 [2019-01-11 11:44:58,601 INFO L226 Difference]: Without dead ends: 244 [2019-01-11 11:44:58,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:44:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-11 11:44:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-01-11 11:44:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 11:44:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-11 11:44:58,658 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-01-11 11:44:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:58,658 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-11 11:44:58,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-11 11:44:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-11 11:44:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-11 11:44:58,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:58,659 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-01-11 11:44:58,659 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:44:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-01-11 11:44:58,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:58,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:58,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:58,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:58,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:00,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:00,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:00,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:45:00,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:45:00,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:00,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:00,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:45:00,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:45:00,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-11 11:45:00,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:45:00,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:00,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:45:00,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:45:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:02,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:07,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:07,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-11 11:45:07,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:07,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 11:45:07,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 11:45:07,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-01-11 11:45:07,710 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-01-11 11:45:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:10,790 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-11 11:45:10,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 11:45:10,790 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-01-11 11:45:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:10,792 INFO L225 Difference]: With dead ends: 250 [2019-01-11 11:45:10,792 INFO L226 Difference]: Without dead ends: 249 [2019-01-11 11:45:10,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:45:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-11 11:45:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-01-11 11:45:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-11 11:45:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-01-11 11:45:10,856 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-01-11 11:45:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:10,856 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-01-11 11:45:10,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 11:45:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-01-11 11:45:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-11 11:45:10,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:10,857 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-01-11 11:45:10,858 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:45:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-01-11 11:45:10,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:10,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:45:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:10,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:12,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:12,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:12,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:45:12,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:45:12,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:12,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:12,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:45:12,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:45:12,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:45:12,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:45:12,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:12,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:45:12,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:12,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:12,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:45:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:14,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:20,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:20,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-11 11:45:20,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:20,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-11 11:45:20,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-11 11:45:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:45:20,043 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-01-11 11:45:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:22,997 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-11 11:45:22,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 11:45:22,997 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-01-11 11:45:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:22,999 INFO L225 Difference]: With dead ends: 255 [2019-01-11 11:45:22,999 INFO L226 Difference]: Without dead ends: 254 [2019-01-11 11:45:23,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 11:45:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-11 11:45:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-11 11:45:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-11 11:45:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-01-11 11:45:23,049 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-01-11 11:45:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:23,050 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-01-11 11:45:23,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-11 11:45:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-01-11 11:45:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-11 11:45:23,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:23,051 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-01-11 11:45:23,052 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:45:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-01-11 11:45:23,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:23,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:45:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:23,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:25,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:25,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:25,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:45:25,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:45:25,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:25,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:25,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:25,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:25,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:25,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:45:25,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:25,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:25,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:45:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:27,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:32,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:32,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-01-11 11:45:32,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:32,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-11 11:45:32,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-11 11:45:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-01-11 11:45:32,757 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-01-11 11:45:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:35,923 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-01-11 11:45:35,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 11:45:35,923 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-01-11 11:45:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:35,925 INFO L225 Difference]: With dead ends: 260 [2019-01-11 11:45:35,925 INFO L226 Difference]: Without dead ends: 259 [2019-01-11 11:45:35,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:45:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-11 11:45:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-01-11 11:45:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-11 11:45:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-11 11:45:35,980 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-01-11 11:45:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:35,981 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-11 11:45:35,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-11 11:45:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-11 11:45:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-11 11:45:35,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:35,983 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-01-11 11:45:35,983 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:45:35,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-01-11 11:45:35,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:35,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:35,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:38,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:38,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:38,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:45:38,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:45:38,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:38,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:38,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:45:38,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:45:38,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-11 11:45:38,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:45:38,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:38,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:45:38,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:38,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:38,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:45:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:40,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:46,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:46,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-11 11:45:46,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:46,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 11:45:46,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 11:45:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:45:46,205 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-01-11 11:45:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:49,520 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-01-11 11:45:49,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:45:49,520 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-01-11 11:45:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:49,521 INFO L225 Difference]: With dead ends: 265 [2019-01-11 11:45:49,521 INFO L226 Difference]: Without dead ends: 264 [2019-01-11 11:45:49,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 11:45:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-11 11:45:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-01-11 11:45:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-11 11:45:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-11 11:45:49,574 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-01-11 11:45:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:49,575 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-11 11:45:49,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 11:45:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-11 11:45:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-11 11:45:49,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:49,576 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-01-11 11:45:49,576 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:45:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-01-11 11:45:49,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:49,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:45:49,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:49,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:51,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:51,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:51,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:45:51,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:45:51,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:51,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:51,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:45:51,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:45:51,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:45:51,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:45:51,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:51,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:45:51,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:45:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:54,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:59,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:59,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-11 11:45:59,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:59,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-11 11:45:59,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-11 11:45:59,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-01-11 11:45:59,404 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-01-11 11:46:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:02,776 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-11 11:46:02,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 11:46:02,776 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-01-11 11:46:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:02,777 INFO L225 Difference]: With dead ends: 270 [2019-01-11 11:46:02,777 INFO L226 Difference]: Without dead ends: 269 [2019-01-11 11:46:02,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 11:46:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-11 11:46:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-01-11 11:46:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-11 11:46:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-01-11 11:46:02,838 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-01-11 11:46:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:02,838 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-01-11 11:46:02,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-11 11:46:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-01-11 11:46:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-11 11:46:02,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:02,840 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-01-11 11:46:02,840 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:46:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:02,840 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-01-11 11:46:02,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:02,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:02,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:02,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:02,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:05,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:05,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:05,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:05,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:05,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:05,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:05,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:05,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:05,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:05,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:46:05,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:05,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:05,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:46:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:07,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:13,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:13,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-11 11:46:13,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:13,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-11 11:46:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-11 11:46:13,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:46:13,218 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-01-11 11:46:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:16,608 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-11 11:46:16,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 11:46:16,608 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-01-11 11:46:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:16,609 INFO L225 Difference]: With dead ends: 275 [2019-01-11 11:46:16,609 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 11:46:16,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 11:46:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 11:46:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-01-11 11:46:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-11 11:46:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-11 11:46:16,667 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-01-11 11:46:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:16,667 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-11 11:46:16,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-11 11:46:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-11 11:46:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-11 11:46:16,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:16,669 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-01-11 11:46:16,669 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:46:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-01-11 11:46:16,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:16,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:16,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:19,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:19,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:19,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:19,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:19,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:19,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:19,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:46:19,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:46:19,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-11 11:46:19,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:46:19,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:19,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:46:19,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:19,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:19,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:46:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:22,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:27,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-11 11:46:27,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:27,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 11:46:27,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 11:46:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-01-11 11:46:27,729 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-01-11 11:46:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:31,257 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-01-11 11:46:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 11:46:31,257 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-01-11 11:46:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:31,258 INFO L225 Difference]: With dead ends: 280 [2019-01-11 11:46:31,258 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 11:46:31,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 11:46:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 11:46:31,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-01-11 11:46:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 11:46:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-01-11 11:46:31,327 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-01-11 11:46:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:31,327 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-01-11 11:46:31,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 11:46:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-01-11 11:46:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-11 11:46:31,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:31,329 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-01-11 11:46:31,329 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:46:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-01-11 11:46:31,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:31,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:31,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:31,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:31,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:33,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:33,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:33,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:33,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:33,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:33,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:33,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:46:33,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:46:33,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:46:33,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:46:33,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:33,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:46:33,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:33,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:33,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:46:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:36,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:42,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:42,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-11 11:46:42,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:42,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-11 11:46:42,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-11 11:46:42,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:46:42,211 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-01-11 11:46:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:45,675 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-11 11:46:45,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:46:45,676 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-01-11 11:46:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:45,677 INFO L225 Difference]: With dead ends: 285 [2019-01-11 11:46:45,677 INFO L226 Difference]: Without dead ends: 284 [2019-01-11 11:46:45,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-01-11 11:46:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-11 11:46:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-01-11 11:46:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-11 11:46:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-11 11:46:45,734 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-01-11 11:46:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:45,734 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-11 11:46:45,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-11 11:46:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-11 11:46:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-11 11:46:45,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:45,736 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-01-11 11:46:45,736 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:46:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-01-11 11:46:45,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:45,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:45,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:48,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:48,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:48,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:48,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:48,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:48,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:48,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:48,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:48,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:48,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:46:48,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:48,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:48,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:46:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:50,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:56,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:56,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-11 11:46:56,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:56,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-11 11:46:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-11 11:46:56,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 11:46:56,705 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-01-11 11:47:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:00,351 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-01-11 11:47:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 11:47:00,352 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-01-11 11:47:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:00,353 INFO L225 Difference]: With dead ends: 290 [2019-01-11 11:47:00,353 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 11:47:00,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-01-11 11:47:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 11:47:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-01-11 11:47:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-11 11:47:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-01-11 11:47:00,413 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-01-11 11:47:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:00,414 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-01-11 11:47:00,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-11 11:47:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-01-11 11:47:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-01-11 11:47:00,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:00,415 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-01-11 11:47:00,415 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:47:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-01-11 11:47:00,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:00,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:00,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:00,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:00,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:03,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:03,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:03,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:47:03,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:47:03,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:03,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:03,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:47:03,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:47:03,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-11 11:47:03,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:47:03,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:03,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:47:03,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:03,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:03,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:47:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:06,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:12,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:12,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-11 11:47:12,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:12,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-11 11:47:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-11 11:47:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:47:12,528 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-01-11 11:47:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:16,254 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-11 11:47:16,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 11:47:16,255 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-01-11 11:47:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:16,256 INFO L225 Difference]: With dead ends: 295 [2019-01-11 11:47:16,256 INFO L226 Difference]: Without dead ends: 294 [2019-01-11 11:47:16,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-01-11 11:47:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-11 11:47:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-01-11 11:47:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-11 11:47:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-01-11 11:47:16,323 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-01-11 11:47:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:16,324 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-01-11 11:47:16,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-11 11:47:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-01-11 11:47:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-11 11:47:16,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:16,325 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-01-11 11:47:16,325 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:47:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-01-11 11:47:16,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:16,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:47:16,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:16,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:19,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:19,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:19,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:47:19,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:47:19,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:19,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:19,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:47:19,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:47:19,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:47:19,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:47:19,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:19,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:47:19,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:19,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:19,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:47:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:21,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:27,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:27,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-11 11:47:27,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:27,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-11 11:47:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-11 11:47:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-01-11 11:47:27,895 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-01-11 11:47:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:31,683 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-01-11 11:47:31,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:47:31,684 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-01-11 11:47:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:31,685 INFO L225 Difference]: With dead ends: 300 [2019-01-11 11:47:31,685 INFO L226 Difference]: Without dead ends: 299 [2019-01-11 11:47:31,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-01-11 11:47:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-11 11:47:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-01-11 11:47:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-11 11:47:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-01-11 11:47:31,755 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-01-11 11:47:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:31,755 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-01-11 11:47:31,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-11 11:47:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-01-11 11:47:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-11 11:47:31,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:31,757 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-01-11 11:47:31,757 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:47:31,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:31,757 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-01-11 11:47:31,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:31,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:31,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:47:31,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:31,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:34,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:34,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:34,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:47:34,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:47:34,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:34,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:34,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:34,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:34,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:47:34,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:47:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:37,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:43,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:43,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-11 11:47:43,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:43,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-11 11:47:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-11 11:47:43,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:47:43,957 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-01-11 11:47:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:48,033 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-01-11 11:47:48,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:47:48,034 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-01-11 11:47:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:48,035 INFO L225 Difference]: With dead ends: 305 [2019-01-11 11:47:48,035 INFO L226 Difference]: Without dead ends: 304 [2019-01-11 11:47:48,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-01-11 11:47:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-11 11:47:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-01-11 11:47:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-11 11:47:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-11 11:47:48,101 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-01-11 11:47:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:48,102 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-11 11:47:48,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-11 11:47:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-11 11:47:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-11 11:47:48,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:48,103 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-01-11 11:47:48,103 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:47:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-01-11 11:47:48,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:48,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:48,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:50,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:50,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:50,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:47:50,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:47:50,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:50,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:50,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:47:50,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:47:51,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-11 11:47:51,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:47:51,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:51,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:47:51,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:51,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:51,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:47:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:54,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:00,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:00,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-11 11:48:00,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:00,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-11 11:48:00,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-11 11:48:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 11:48:00,325 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-01-11 11:48:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:04,577 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-01-11 11:48:04,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 11:48:04,577 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-01-11 11:48:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:04,578 INFO L225 Difference]: With dead ends: 310 [2019-01-11 11:48:04,578 INFO L226 Difference]: Without dead ends: 309 [2019-01-11 11:48:04,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-01-11 11:48:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-11 11:48:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-01-11 11:48:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-11 11:48:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-01-11 11:48:04,645 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-01-11 11:48:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:04,646 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-01-11 11:48:04,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-11 11:48:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-01-11 11:48:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-11 11:48:04,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:04,647 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-01-11 11:48:04,647 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:48:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-01-11 11:48:04,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:04,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:48:04,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:04,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:07,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:07,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:07,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:48:07,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:48:07,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:07,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:07,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:48:07,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:48:07,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:48:07,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:48:07,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:07,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:48:07,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:48:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:10,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:16,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:16,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-11 11:48:16,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:16,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-11 11:48:16,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-11 11:48:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:48:16,658 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-01-11 11:48:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:20,951 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-11 11:48:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 11:48:20,952 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-01-11 11:48:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:20,953 INFO L225 Difference]: With dead ends: 315 [2019-01-11 11:48:20,953 INFO L226 Difference]: Without dead ends: 314 [2019-01-11 11:48:20,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-01-11 11:48:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-11 11:48:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-01-11 11:48:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-11 11:48:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-01-11 11:48:21,034 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-01-11 11:48:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:21,034 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-01-11 11:48:21,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-11 11:48:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-01-11 11:48:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-11 11:48:21,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:21,035 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-01-11 11:48:21,035 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:48:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:21,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-01-11 11:48:21,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:21,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:21,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:48:21,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:21,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:24,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:24,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:24,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:48:24,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:48:24,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:24,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:24,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:24,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:24,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:24,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:48:24,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:24,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:24,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:48:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:27,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:33,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:33,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-11 11:48:33,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:33,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-11 11:48:33,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-11 11:48:33,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-01-11 11:48:33,197 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-01-11 11:48:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:37,640 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-01-11 11:48:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-11 11:48:37,641 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-01-11 11:48:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:37,642 INFO L225 Difference]: With dead ends: 320 [2019-01-11 11:48:37,642 INFO L226 Difference]: Without dead ends: 319 [2019-01-11 11:48:37,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-01-11 11:48:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-11 11:48:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-01-11 11:48:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-11 11:48:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-01-11 11:48:37,711 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-01-11 11:48:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:37,712 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-01-11 11:48:37,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-11 11:48:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-01-11 11:48:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-11 11:48:37,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:37,713 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-01-11 11:48:37,713 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:48:37,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-01-11 11:48:37,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:37,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:37,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:37,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:37,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:40,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:40,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:40,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:48:40,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:48:40,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:40,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:40,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:48:40,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:48:41,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-11 11:48:41,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:48:41,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:41,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:48:41,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:41,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:41,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:48:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:44,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:50,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:50,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-11 11:48:50,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:50,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-11 11:48:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-11 11:48:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:48:50,501 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-01-11 11:48:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:54,958 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-01-11 11:48:54,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:48:54,958 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-01-11 11:48:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:54,959 INFO L225 Difference]: With dead ends: 325 [2019-01-11 11:48:54,959 INFO L226 Difference]: Without dead ends: 324 [2019-01-11 11:48:54,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-01-11 11:48:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-11 11:48:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-01-11 11:48:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-11 11:48:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-11 11:48:55,035 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-01-11 11:48:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:55,035 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-11 11:48:55,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-11 11:48:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-11 11:48:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-11 11:48:55,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:55,037 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-01-11 11:48:55,037 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:48:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-01-11 11:48:55,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:55,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:48:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:55,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:58,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:58,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:58,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:48:58,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:48:58,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:58,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:58,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:48:58,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:48:58,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:48:58,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:48:58,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:58,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:48:58,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:58,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:58,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:49:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:01,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:07,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:07,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-11 11:49:07,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:07,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-11 11:49:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-11 11:49:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-01-11 11:49:07,817 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-01-11 11:49:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:12,370 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-01-11 11:49:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:49:12,370 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-01-11 11:49:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:12,371 INFO L225 Difference]: With dead ends: 330 [2019-01-11 11:49:12,371 INFO L226 Difference]: Without dead ends: 329 [2019-01-11 11:49:12,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-01-11 11:49:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-01-11 11:49:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-01-11 11:49:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-11 11:49:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-01-11 11:49:12,450 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-01-11 11:49:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:12,450 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-01-11 11:49:12,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-11 11:49:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-01-11 11:49:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-11 11:49:12,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:12,451 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-01-11 11:49:12,452 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:49:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-01-11 11:49:12,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:12,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:49:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:12,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:15,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:15,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:15,655 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:49:15,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:49:15,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:15,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:49:15,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:15,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:49:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:15,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:15,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:49:15,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:15,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:15,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:49:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:18,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:25,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:25,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-11 11:49:25,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:25,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-11 11:49:25,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-11 11:49:25,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:49:25,220 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-01-11 11:49:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:29,870 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-11 11:49:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 11:49:29,871 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-01-11 11:49:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:29,872 INFO L225 Difference]: With dead ends: 335 [2019-01-11 11:49:29,872 INFO L226 Difference]: Without dead ends: 334 [2019-01-11 11:49:29,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-01-11 11:49:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-11 11:49:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-01-11 11:49:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-11 11:49:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-01-11 11:49:29,949 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-01-11 11:49:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:29,949 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-01-11 11:49:29,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-11 11:49:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-01-11 11:49:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-11 11:49:29,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:29,950 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-01-11 11:49:29,951 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:49:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-01-11 11:49:29,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:29,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:29,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:29,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:29,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:33,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:33,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:33,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:49:33,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:49:33,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:33,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:49:33,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:49:33,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:49:33,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-11 11:49:33,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:49:33,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:33,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:49:33,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:33,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:33,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:49:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:37,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:43,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:43,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-11 11:49:43,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:43,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-11 11:49:43,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-11 11:49:43,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-01-11 11:49:43,452 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-01-11 11:49:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:48,309 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-01-11 11:49:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-11 11:49:48,309 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-01-11 11:49:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:48,311 INFO L225 Difference]: With dead ends: 340 [2019-01-11 11:49:48,311 INFO L226 Difference]: Without dead ends: 339 [2019-01-11 11:49:48,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-01-11 11:49:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-11 11:49:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-01-11 11:49:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-11 11:49:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-01-11 11:49:48,392 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-01-11 11:49:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:48,392 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-01-11 11:49:48,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-11 11:49:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-01-11 11:49:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-11 11:49:48,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:48,393 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-01-11 11:49:48,394 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:49:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-01-11 11:49:48,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:48,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:49:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:48,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:51,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:51,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:51,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:49:51,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:49:51,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:51,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:49:51,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:49:51,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:49:51,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:49:51,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:49:52,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:52,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:49:52,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:52,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:52,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:49:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:55,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:01,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:01,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-11 11:50:01,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:01,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-11 11:50:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-11 11:50:01,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:50:01,654 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-01-11 11:50:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:06,594 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-01-11 11:50:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 11:50:06,594 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-01-11 11:50:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:06,595 INFO L225 Difference]: With dead ends: 345 [2019-01-11 11:50:06,595 INFO L226 Difference]: Without dead ends: 344 [2019-01-11 11:50:06,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-01-11 11:50:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-11 11:50:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-01-11 11:50:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 11:50:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-11 11:50:06,688 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-01-11 11:50:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:06,689 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-11 11:50:06,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-11 11:50:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-11 11:50:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-11 11:50:06,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:06,690 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-01-11 11:50:06,690 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:50:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-01-11 11:50:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:06,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:50:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:06,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:10,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:10,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:10,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:50:10,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:50:10,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:10,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:50:10,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:10,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:50:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:10,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:10,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:50:10,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:10,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:50:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:13,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:20,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:20,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-11 11:50:20,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:20,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-11 11:50:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-11 11:50:20,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-01-11 11:50:20,165 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-01-11 11:50:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:25,139 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-01-11 11:50:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 11:50:25,139 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-01-11 11:50:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:25,140 INFO L225 Difference]: With dead ends: 350 [2019-01-11 11:50:25,140 INFO L226 Difference]: Without dead ends: 349 [2019-01-11 11:50:25,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-01-11 11:50:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-11 11:50:25,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-01-11 11:50:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-01-11 11:50:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-01-11 11:50:25,228 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-01-11 11:50:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:25,228 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-01-11 11:50:25,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-11 11:50:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-01-11 11:50:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-11 11:50:25,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:25,229 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-01-11 11:50:25,230 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:50:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-01-11 11:50:25,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:25,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:25,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:25,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:25,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:28,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:28,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:28,790 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:50:28,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:50:28,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:28,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:50:28,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:50:28,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:50:29,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-11 11:50:29,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:50:29,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:29,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:50:29,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:29,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:29,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:50:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:32,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:39,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:39,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-11 11:50:39,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:39,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-11 11:50:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-11 11:50:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:50:39,191 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-01-11 11:50:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:44,266 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-11 11:50:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 11:50:44,266 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-01-11 11:50:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:44,268 INFO L225 Difference]: With dead ends: 355 [2019-01-11 11:50:44,268 INFO L226 Difference]: Without dead ends: 354 [2019-01-11 11:50:44,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-01-11 11:50:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-11 11:50:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-01-11 11:50:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-11 11:50:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-01-11 11:50:44,357 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-01-11 11:50:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:44,357 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-01-11 11:50:44,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-11 11:50:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-01-11 11:50:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-11 11:50:44,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:44,358 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-01-11 11:50:44,359 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:50:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-01-11 11:50:44,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:44,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:44,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:50:44,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:44,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:47,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:47,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:47,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:50:47,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:50:47,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:47,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:50:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:50:47,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:50:48,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:50:48,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:50:48,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:48,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:50:48,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:48,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:48,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:50:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:52,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:58,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:58,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-11 11:50:58,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:58,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-11 11:50:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-11 11:50:58,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-01-11 11:50:58,458 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-01-11 11:51:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:03,739 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-01-11 11:51:03,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 11:51:03,739 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-01-11 11:51:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:03,740 INFO L225 Difference]: With dead ends: 360 [2019-01-11 11:51:03,740 INFO L226 Difference]: Without dead ends: 359 [2019-01-11 11:51:03,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-01-11 11:51:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-11 11:51:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-01-11 11:51:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 11:51:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-01-11 11:51:03,832 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-01-11 11:51:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:03,832 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-01-11 11:51:03,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-11 11:51:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-01-11 11:51:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-11 11:51:03,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:03,834 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-01-11 11:51:03,834 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:51:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:03,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-01-11 11:51:03,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:03,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:03,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:51:03,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:03,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:07,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:07,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:07,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:51:07,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:51:07,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:07,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:51:07,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:07,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:51:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:07,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:07,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:51:07,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:07,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:07,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:51:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:11,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:17,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:17,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-11 11:51:17,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:17,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-11 11:51:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-11 11:51:17,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:51:17,975 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-01-11 11:51:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:23,375 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-01-11 11:51:23,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:51:23,375 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-01-11 11:51:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:23,376 INFO L225 Difference]: With dead ends: 365 [2019-01-11 11:51:23,376 INFO L226 Difference]: Without dead ends: 364 [2019-01-11 11:51:23,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-01-11 11:51:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-11 11:51:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-01-11 11:51:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 11:51:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-11 11:51:23,472 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-01-11 11:51:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:23,472 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-11 11:51:23,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-11 11:51:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-11 11:51:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-11 11:51:23,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:23,473 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-01-11 11:51:23,474 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:51:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-01-11 11:51:23,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:23,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:23,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:23,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:23,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:27,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:27,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:27,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:51:27,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:51:27,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:27,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:51:27,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:51:27,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:51:27,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-11 11:51:27,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:51:28,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:28,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:51:28,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:28,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:28,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:51:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:31,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:38,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:38,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-11 11:51:38,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:38,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-11 11:51:38,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-11 11:51:38,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-01-11 11:51:38,312 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-01-11 11:51:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:43,831 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-01-11 11:51:43,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 11:51:43,831 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-01-11 11:51:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:43,833 INFO L225 Difference]: With dead ends: 370 [2019-01-11 11:51:43,833 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 11:51:43,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-01-11 11:51:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 11:51:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-01-11 11:51:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-11 11:51:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-01-11 11:51:43,930 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-01-11 11:51:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:43,930 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-01-11 11:51:43,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-11 11:51:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-01-11 11:51:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-01-11 11:51:43,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:43,932 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-01-11 11:51:43,932 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:51:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-01-11 11:51:43,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:43,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:51:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:43,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:47,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:47,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:47,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:51:47,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:51:47,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:47,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:51:47,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:51:47,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:51:48,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:51:48,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:51:48,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:48,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:51:48,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:48,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:48,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:51:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:52,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:58,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:58,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-11 11:51:58,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:58,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-11 11:51:58,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-11 11:51:58,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:51:58,369 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-01-11 11:52:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:52:03,964 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-11 11:52:03,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 11:52:03,964 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-01-11 11:52:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:52:03,966 INFO L225 Difference]: With dead ends: 375 [2019-01-11 11:52:03,966 INFO L226 Difference]: Without dead ends: 374 [2019-01-11 11:52:03,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-01-11 11:52:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-11 11:52:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-01-11 11:52:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-01-11 11:52:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-01-11 11:52:04,062 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-01-11 11:52:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:04,063 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-01-11 11:52:04,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-11 11:52:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-01-11 11:52:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-11 11:52:04,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:04,064 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-01-11 11:52:04,064 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:52:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-01-11 11:52:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:04,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:04,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:52:04,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:04,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:08,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:08,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:08,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:52:08,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:52:08,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:08,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:52:08,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:08,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:52:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:08,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:52:08,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:52:08,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:08,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:08,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:52:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:12,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:52:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:18,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:52:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-11 11:52:18,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:52:18,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-11 11:52:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-11 11:52:18,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-01-11 11:52:18,585 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-01-11 11:52:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:52:24,362 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-01-11 11:52:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-11 11:52:24,363 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-01-11 11:52:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:52:24,364 INFO L225 Difference]: With dead ends: 380 [2019-01-11 11:52:24,364 INFO L226 Difference]: Without dead ends: 379 [2019-01-11 11:52:24,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-01-11 11:52:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-11 11:52:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-01-11 11:52:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-11 11:52:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-01-11 11:52:24,475 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-01-11 11:52:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:24,475 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-01-11 11:52:24,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-11 11:52:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-01-11 11:52:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-11 11:52:24,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:24,477 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-01-11 11:52:24,477 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:52:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-01-11 11:52:24,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:24,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:24,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:24,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:24,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:28,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:28,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:28,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:52:28,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:52:28,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:28,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:52:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:52:28,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:52:29,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-11 11:52:29,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:52:29,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:52:29,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:52:29,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:29,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:29,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:52:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:33,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:52:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:39,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:52:39,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-11 11:52:39,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:52:39,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-11 11:52:39,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-11 11:52:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:52:39,979 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-01-11 11:52:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:52:45,735 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-01-11 11:52:45,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 11:52:45,735 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-01-11 11:52:45,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:52:45,737 INFO L225 Difference]: With dead ends: 385 [2019-01-11 11:52:45,737 INFO L226 Difference]: Without dead ends: 384 [2019-01-11 11:52:45,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-01-11 11:52:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-01-11 11:52:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-01-11 11:52:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-11 11:52:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-11 11:52:45,845 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-01-11 11:52:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:45,845 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-11 11:52:45,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-11 11:52:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-11 11:52:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-11 11:52:45,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:45,846 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-01-11 11:52:45,846 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:52:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:45,847 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-01-11 11:52:45,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:45,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:45,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:52:45,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:45,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:50,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:50,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:50,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:52:50,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:52:50,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:50,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-11 11:52:50,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:52:50,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:52:50,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:52:50,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:52:50,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:52:50,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:52:50,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:50,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:50,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:52:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:54,614 INFO L316 TraceCheckSpWp]: Computing backward predicates...