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-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:26:11,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:26:11,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:26:11,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:26:11,246 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:26:11,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:26:11,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:26:11,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:26:11,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:26:11,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:26:11,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:26:11,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:26:11,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:26:11,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:26:11,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:26:11,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:26:11,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:26:11,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:26:11,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:26:11,264 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:26:11,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:26:11,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:26:11,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:26:11,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:26:11,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:26:11,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:26:11,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:26:11,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:26:11,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:26:11,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:26:11,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:26:11,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:26:11,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:26:11,275 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:26:11,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:26:11,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:26:11,277 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-24 14:26:11,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:26:11,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:26:11,291 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:26:11,292 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:26:11,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:26:11,292 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:26:11,292 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:26:11,292 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:26:11,293 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:26:11,293 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:26:11,293 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:26:11,293 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:26:11,293 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:26:11,294 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:26:11,294 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:26:11,295 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:26:11,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:26:11,295 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:26:11,295 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:26:11,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:26:11,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:26:11,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:26:11,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:26:11,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:26:11,297 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:26:11,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:26:11,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:26:11,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:26:11,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:26:11,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:26:11,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:26:11,299 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:26:11,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:26:11,299 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:26:11,299 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:26:11,299 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:26:11,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:26:11,300 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:26:11,300 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:26:11,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:26:11,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:26:11,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:26:11,349 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:26:11,350 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:26:11,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-12-24 14:26:11,351 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-12-24 14:26:11,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:26:11,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:26:11,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:26:11,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:26:11,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:26:11,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,441 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-24 14:26:11,441 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-24 14:26:11,442 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-24 14:26:11,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:26:11,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:26:11,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:26:11,464 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:26:11,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... [2018-12-24 14:26:11,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:26:11,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:26:11,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:26:11,491 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:26:11,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:26:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-24 14:26:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-24 14:26:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-24 14:26:11,852 INFO L272 CfgBuilder]: Using library mode [2018-12-24 14:26:11,852 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-24 14:26:11,853 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:26:11 BoogieIcfgContainer [2018-12-24 14:26:11,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:26:11,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:26:11,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:26:11,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:26:11,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 02:26:11" (1/2) ... [2018-12-24 14:26:11,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@925dbd3 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:26:11, skipping insertion in model container [2018-12-24 14:26:11,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:26:11" (2/2) ... [2018-12-24 14:26:11,861 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-12-24 14:26:11,871 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:26:11,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 14:26:11,897 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 14:26:11,930 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:26:11,930 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:26:11,930 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:26:11,930 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:26:11,932 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:26:11,932 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:26:11,932 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:26:11,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:26:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-24 14:26:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 14:26:11,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:11,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 14:26:11,958 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-24 14:26:11,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:12,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:12,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:12,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:12,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:26:12,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 14:26:12,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:26:12,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:26:12,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:26:12,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:26:12,201 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-24 14:26:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:12,318 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-24 14:26:12,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:26:12,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 14:26:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:12,335 INFO L225 Difference]: With dead ends: 15 [2018-12-24 14:26:12,335 INFO L226 Difference]: Without dead ends: 8 [2018-12-24 14:26:12,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:26:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-24 14:26:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-24 14:26:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 14:26:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-24 14:26:12,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2018-12-24 14:26:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:12,386 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-24 14:26:12,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:26:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-24 14:26:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 14:26:12,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:12,387 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 14:26:12,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2018-12-24 14:26:12,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:12,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:12,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:12,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:12,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:12,527 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 14:26:12,529 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2018-12-24 14:26:12,592 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:26:12,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:26:24,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:26:24,511 INFO L272 AbstractInterpreter]: Visited 5 different actions 38 times. Merged at 4 different actions 33 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 14:26:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:24,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:26:24,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:24,518 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 [2018-12-24 14:26:24,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:24,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:24,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:24,743 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 [2018-12-24 14:26:24,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:24,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:24,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:24,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:25,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:25,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 14:26:25,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:25,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 14:26:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 14:26:25,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:26:25,103 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-24 14:26:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:25,183 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-24 14:26:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:26:25,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-24 14:26:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:25,185 INFO L225 Difference]: With dead ends: 12 [2018-12-24 14:26:25,185 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 14:26:25,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-24 14:26:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 14:26:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-24 14:26:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 14:26:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-24 14:26:25,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2018-12-24 14:26:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:25,191 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-24 14:26:25,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 14:26:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-24 14:26:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 14:26:25,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:25,193 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2018-12-24 14:26:25,193 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:25,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2018-12-24 14:26:25,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:25,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:25,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:25,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:25,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:25,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:25,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:25,345 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 [2018-12-24 14:26:25,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:25,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:25,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:26:25,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:25,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:25,396 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 [2018-12-24 14:26:25,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:25,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:25,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:25,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:25,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:25,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 14:26:25,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:25,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 14:26:25,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 14:26:25,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:26:25,838 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-12-24 14:26:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:25,984 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-24 14:26:25,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 14:26:25,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-24 14:26:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:25,986 INFO L225 Difference]: With dead ends: 15 [2018-12-24 14:26:25,986 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 14:26:25,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-24 14:26:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 14:26:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-24 14:26:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 14:26:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-24 14:26:25,990 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2018-12-24 14:26:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:25,991 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-24 14:26:25,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 14:26:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-24 14:26:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 14:26:25,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:25,992 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2018-12-24 14:26:25,992 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2018-12-24 14:26:25,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:25,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:25,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:25,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:25,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:26,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:26,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:26,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:26,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:26,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:26,071 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 [2018-12-24 14:26:26,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:26,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:26,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:26,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:26,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:26,128 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 [2018-12-24 14:26:26,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:26,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:26,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:26,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:26,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:26,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 14:26:26,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:26,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 14:26:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 14:26:26,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:26:26,459 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-12-24 14:26:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:26,820 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-24 14:26:26,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 14:26:26,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-12-24 14:26:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:26,821 INFO L225 Difference]: With dead ends: 18 [2018-12-24 14:26:26,821 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 14:26:26,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-24 14:26:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 14:26:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-24 14:26:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 14:26:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-24 14:26:26,825 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-12-24 14:26:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:26,826 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-24 14:26:26,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 14:26:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-24 14:26:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-24 14:26:26,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:26,827 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2018-12-24 14:26:26,827 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:26,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2018-12-24 14:26:26,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:26,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:26,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:26,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:26,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:26,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:26,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:26,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:26,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:26,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:26,995 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 [2018-12-24 14:26:27,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:27,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:27,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:27,030 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 [2018-12-24 14:26:27,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:27,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:27,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:27,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:27,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:27,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 14:26:27,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:27,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 14:26:27,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 14:26:27,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:26:27,352 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2018-12-24 14:26:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:27,417 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-24 14:26:27,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 14:26:27,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-12-24 14:26:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:27,420 INFO L225 Difference]: With dead ends: 21 [2018-12-24 14:26:27,420 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 14:26:27,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-24 14:26:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 14:26:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-24 14:26:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-24 14:26:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-24 14:26:27,425 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-12-24 14:26:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:27,425 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-24 14:26:27,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:26:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-24 14:26:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-24 14:26:27,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:27,426 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2018-12-24 14:26:27,426 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2018-12-24 14:26:27,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:27,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:27,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:27,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:27,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:27,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:27,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:27,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:27,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:27,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:27,531 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 [2018-12-24 14:26:27,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:27,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:27,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-24 14:26:27,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:27,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:27,566 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 [2018-12-24 14:26:27,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:27,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:27,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:27,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:27,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:27,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 14:26:27,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:27,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 14:26:27,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 14:26:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:26:27,885 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2018-12-24 14:26:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:27,948 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-24 14:26:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 14:26:27,948 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2018-12-24 14:26:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:27,949 INFO L225 Difference]: With dead ends: 24 [2018-12-24 14:26:27,950 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 14:26:27,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:26:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 14:26:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-24 14:26:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 14:26:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-24 14:26:27,955 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-12-24 14:26:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:27,956 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-24 14:26:27,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 14:26:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-24 14:26:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-24 14:26:27,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:27,957 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2018-12-24 14:26:27,957 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:27,957 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2018-12-24 14:26:27,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:27,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:27,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:28,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:28,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:28,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:28,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:28,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:28,080 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 [2018-12-24 14:26:28,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:28,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:28,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:28,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:28,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:28,142 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 [2018-12-24 14:26:28,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:28,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:28,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:28,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:28,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:28,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-24 14:26:28,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:28,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 14:26:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 14:26:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-24 14:26:28,393 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2018-12-24 14:26:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:28,487 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-24 14:26:28,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:26:28,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-24 14:26:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:28,490 INFO L225 Difference]: With dead ends: 27 [2018-12-24 14:26:28,490 INFO L226 Difference]: Without dead ends: 26 [2018-12-24 14:26:28,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-24 14:26:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-24 14:26:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-24 14:26:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 14:26:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-24 14:26:28,496 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-12-24 14:26:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:28,496 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-24 14:26:28,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 14:26:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-24 14:26:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 14:26:28,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:28,497 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2018-12-24 14:26:28,497 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:28,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2018-12-24 14:26:28,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:28,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:28,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:28,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:28,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:28,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:28,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:28,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:28,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:28,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:28,611 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 [2018-12-24 14:26:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:28,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:28,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:28,637 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 [2018-12-24 14:26:28,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:28,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:28,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:28,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:28,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-24 14:26:28,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 14:26:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 14:26:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:26:28,925 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2018-12-24 14:26:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:29,213 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-24 14:26:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:26:29,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-12-24 14:26:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:29,214 INFO L225 Difference]: With dead ends: 30 [2018-12-24 14:26:29,214 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 14:26:29,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-24 14:26:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 14:26:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-24 14:26:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 14:26:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-24 14:26:29,219 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-12-24 14:26:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:29,220 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-24 14:26:29,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 14:26:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-24 14:26:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-24 14:26:29,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:29,221 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2018-12-24 14:26:29,221 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2018-12-24 14:26:29,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:29,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:29,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:29,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:29,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:29,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:29,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:29,357 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 [2018-12-24 14:26:29,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:29,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:29,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-24 14:26:29,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:29,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:29,409 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 [2018-12-24 14:26:29,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:29,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:29,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:29,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:29,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:29,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-24 14:26:29,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:29,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 14:26:29,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 14:26:29,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-24 14:26:29,896 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2018-12-24 14:26:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:30,063 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-24 14:26:30,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 14:26:30,064 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-12-24 14:26:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:30,065 INFO L225 Difference]: With dead ends: 33 [2018-12-24 14:26:30,065 INFO L226 Difference]: Without dead ends: 32 [2018-12-24 14:26:30,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-24 14:26:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-24 14:26:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-24 14:26:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 14:26:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-24 14:26:30,070 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-12-24 14:26:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:30,070 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-24 14:26:30,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 14:26:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-24 14:26:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-24 14:26:30,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:30,071 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2018-12-24 14:26:30,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2018-12-24 14:26:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:30,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:30,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:30,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:30,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:30,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:30,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:30,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:30,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:30,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:30,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:30,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:30,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:30,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:30,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 [2018-12-24 14:26:30,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:30,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:30,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:30,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:30,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:30,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-24 14:26:30,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:30,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 14:26:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 14:26:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:26:30,827 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2018-12-24 14:26:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:30,904 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-24 14:26:30,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 14:26:30,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-12-24 14:26:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:30,906 INFO L225 Difference]: With dead ends: 36 [2018-12-24 14:26:30,906 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 14:26:30,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-24 14:26:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 14:26:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-24 14:26:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-24 14:26:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-24 14:26:30,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-12-24 14:26:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:30,912 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-24 14:26:30,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 14:26:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-24 14:26:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-24 14:26:30,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:30,913 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2018-12-24 14:26:30,913 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2018-12-24 14:26:30,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:30,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:30,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:30,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:30,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:31,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:31,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:31,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:31,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:31,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:31,338 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 [2018-12-24 14:26:31,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:31,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:31,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:31,386 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 [2018-12-24 14:26:31,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:31,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:31,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:31,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:31,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:31,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-24 14:26:31,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:31,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 14:26:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 14:26:31,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 14:26:31,865 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2018-12-24 14:26:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:31,950 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-24 14:26:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 14:26:31,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-12-24 14:26:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:31,953 INFO L225 Difference]: With dead ends: 39 [2018-12-24 14:26:31,953 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 14:26:31,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 14:26:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 14:26:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-24 14:26:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 14:26:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-24 14:26:31,959 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-12-24 14:26:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:31,959 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-24 14:26:31,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 14:26:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-24 14:26:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 14:26:31,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:31,960 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2018-12-24 14:26:31,960 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2018-12-24 14:26:31,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:31,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:31,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:32,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:32,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:32,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:32,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:32,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:32,147 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 [2018-12-24 14:26:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:32,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:32,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-24 14:26:32,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:32,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:32,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 [2018-12-24 14:26:32,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:32,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:32,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:32,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:32,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:32,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-24 14:26:32,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:32,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 14:26:32,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 14:26:32,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:26:32,745 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2018-12-24 14:26:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:32,844 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-24 14:26:32,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 14:26:32,845 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-12-24 14:26:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:32,846 INFO L225 Difference]: With dead ends: 42 [2018-12-24 14:26:32,846 INFO L226 Difference]: Without dead ends: 41 [2018-12-24 14:26:32,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 14:26:32,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-24 14:26:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-24 14:26:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 14:26:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-24 14:26:32,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-12-24 14:26:32,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:32,853 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-24 14:26:32,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 14:26:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-24 14:26:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-24 14:26:32,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:32,854 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2018-12-24 14:26:32,854 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2018-12-24 14:26:32,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:32,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:32,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:33,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:33,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:33,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:33,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:33,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:33,074 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 [2018-12-24 14:26:33,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:33,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:33,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:33,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:33,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:33,110 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 [2018-12-24 14:26:33,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:33,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:33,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:33,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:33,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:33,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-24 14:26:33,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:33,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 14:26:33,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 14:26:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 14:26:33,775 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2018-12-24 14:26:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:33,864 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-24 14:26:33,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 14:26:33,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-12-24 14:26:33,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:33,866 INFO L225 Difference]: With dead ends: 45 [2018-12-24 14:26:33,866 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 14:26:33,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 14:26:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 14:26:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-24 14:26:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-24 14:26:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-24 14:26:33,873 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-12-24 14:26:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:33,873 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-24 14:26:33,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 14:26:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-24 14:26:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-24 14:26:33,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:33,875 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2018-12-24 14:26:33,875 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:33,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:33,875 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2018-12-24 14:26:33,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:33,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:33,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:33,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:33,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:34,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:34,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:34,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:34,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:34,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:34,117 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 [2018-12-24 14:26:34,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:34,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:34,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:34,149 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 [2018-12-24 14:26:34,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:34,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:34,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:34,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:35,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-24 14:26:35,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:35,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 14:26:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 14:26:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:26:35,320 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2018-12-24 14:26:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:35,424 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-24 14:26:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 14:26:35,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2018-12-24 14:26:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:35,426 INFO L225 Difference]: With dead ends: 48 [2018-12-24 14:26:35,426 INFO L226 Difference]: Without dead ends: 47 [2018-12-24 14:26:35,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 14:26:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-24 14:26:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-24 14:26:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-24 14:26:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-24 14:26:35,434 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-12-24 14:26:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:35,437 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-24 14:26:35,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 14:26:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-24 14:26:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-24 14:26:35,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:35,438 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2018-12-24 14:26:35,438 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2018-12-24 14:26:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:35,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:35,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:35,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:35,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:35,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:35,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:35,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:35,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:35,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:35,801 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 [2018-12-24 14:26:35,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:35,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:35,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-24 14:26:35,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:35,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:35,894 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 [2018-12-24 14:26:35,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:35,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:35,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:37,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:37,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:37,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-24 14:26:37,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:37,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 14:26:37,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 14:26:37,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 14:26:37,388 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2018-12-24 14:26:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:37,643 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-24 14:26:37,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 14:26:37,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-12-24 14:26:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:37,645 INFO L225 Difference]: With dead ends: 51 [2018-12-24 14:26:37,645 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 14:26:37,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 14:26:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 14:26:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-24 14:26:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 14:26:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-24 14:26:37,651 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-12-24 14:26:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:37,651 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-24 14:26:37,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 14:26:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-24 14:26:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 14:26:37,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:37,652 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2018-12-24 14:26:37,652 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2018-12-24 14:26:37,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:37,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:37,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:37,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:38,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:38,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:38,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:38,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:38,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:38,439 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 [2018-12-24 14:26:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:38,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:38,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:38,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:38,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:38,476 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 [2018-12-24 14:26:38,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:38,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:38,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:38,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:39,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:39,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-24 14:26:39,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:39,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 14:26:39,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 14:26:39,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:26:39,094 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2018-12-24 14:26:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:39,200 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-24 14:26:39,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 14:26:39,201 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-12-24 14:26:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:39,202 INFO L225 Difference]: With dead ends: 54 [2018-12-24 14:26:39,202 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 14:26:39,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 14:26:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 14:26:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-24 14:26:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-24 14:26:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-24 14:26:39,210 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-12-24 14:26:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:39,211 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-24 14:26:39,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 14:26:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-24 14:26:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-24 14:26:39,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:39,212 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2018-12-24 14:26:39,212 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2018-12-24 14:26:39,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:39,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:39,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:39,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:39,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:39,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:39,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:39,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:39,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:39,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:39,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:39,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:39,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:39,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:39,578 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 [2018-12-24 14:26:39,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:39,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:39,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:41,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:41,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:41,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-24 14:26:41,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:41,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 14:26:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 14:26:41,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 14:26:41,792 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2018-12-24 14:26:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:41,922 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-24 14:26:41,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 14:26:41,922 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2018-12-24 14:26:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:41,923 INFO L225 Difference]: With dead ends: 57 [2018-12-24 14:26:41,923 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 14:26:41,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 14:26:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 14:26:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-24 14:26:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 14:26:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-24 14:26:41,931 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-12-24 14:26:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:41,931 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-24 14:26:41,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 14:26:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-24 14:26:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-24 14:26:41,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:41,932 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2018-12-24 14:26:41,932 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2018-12-24 14:26:41,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:41,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:41,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:42,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:42,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:42,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:42,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:42,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:42,184 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 [2018-12-24 14:26:42,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:42,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:42,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-24 14:26:42,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:42,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:42,301 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 [2018-12-24 14:26:42,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:42,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:42,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:42,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:43,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:43,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-24 14:26:43,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:43,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 14:26:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 14:26:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:26:43,062 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2018-12-24 14:26:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:43,186 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-24 14:26:43,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 14:26:43,186 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2018-12-24 14:26:43,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:43,187 INFO L225 Difference]: With dead ends: 60 [2018-12-24 14:26:43,187 INFO L226 Difference]: Without dead ends: 59 [2018-12-24 14:26:43,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 14:26:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-24 14:26:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-24 14:26:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-24 14:26:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-24 14:26:43,194 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-12-24 14:26:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:43,194 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-24 14:26:43,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 14:26:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-24 14:26:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-24 14:26:43,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:43,196 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2018-12-24 14:26:43,196 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2018-12-24 14:26:43,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:43,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:43,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:43,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:43,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:43,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:43,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:43,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:43,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:43,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:43,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:43,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:43,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:43,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:43,590 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 [2018-12-24 14:26:43,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:43,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:43,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:44,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:44,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:44,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-24 14:26:44,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:44,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 14:26:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 14:26:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 14:26:44,851 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2018-12-24 14:26:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:44,973 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-24 14:26:44,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 14:26:44,973 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2018-12-24 14:26:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:44,974 INFO L225 Difference]: With dead ends: 63 [2018-12-24 14:26:44,974 INFO L226 Difference]: Without dead ends: 62 [2018-12-24 14:26:44,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 14:26:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-24 14:26:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-24 14:26:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 14:26:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-24 14:26:44,979 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-12-24 14:26:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:44,980 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-24 14:26:44,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 14:26:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-24 14:26:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 14:26:44,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:44,981 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2018-12-24 14:26:44,981 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:44,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:44,981 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2018-12-24 14:26:44,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:44,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:44,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:44,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:44,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:45,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:45,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:45,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:45,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:45,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:45,483 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 [2018-12-24 14:26:45,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:45,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:45,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:45,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 [2018-12-24 14:26:45,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:45,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:45,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:45,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:46,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:46,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-24 14:26:46,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:46,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 14:26:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 14:26:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:26:46,415 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2018-12-24 14:26:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:46,549 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-24 14:26:46,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 14:26:46,549 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2018-12-24 14:26:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:46,550 INFO L225 Difference]: With dead ends: 66 [2018-12-24 14:26:46,550 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 14:26:46,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 14:26:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 14:26:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-24 14:26:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-24 14:26:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-24 14:26:46,556 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-12-24 14:26:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:46,556 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-24 14:26:46,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 14:26:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-24 14:26:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-24 14:26:46,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:46,557 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2018-12-24 14:26:46,557 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:46,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2018-12-24 14:26:46,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:46,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:46,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:47,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:47,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:47,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:47,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:47,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:47,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:47,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:47,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:47,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-24 14:26:47,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:47,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:47,384 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 [2018-12-24 14:26:47,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:47,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:47,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:47,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-24 14:26:48,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:48,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 14:26:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 14:26:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 14:26:48,577 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2018-12-24 14:26:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:48,750 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-24 14:26:48,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 14:26:48,750 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2018-12-24 14:26:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:48,751 INFO L225 Difference]: With dead ends: 69 [2018-12-24 14:26:48,751 INFO L226 Difference]: Without dead ends: 68 [2018-12-24 14:26:48,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 14:26:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-24 14:26:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-12-24 14:26:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-24 14:26:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-24 14:26:48,759 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-12-24 14:26:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:48,759 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-24 14:26:48,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 14:26:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-24 14:26:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-24 14:26:48,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:48,760 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2018-12-24 14:26:48,760 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:48,761 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2018-12-24 14:26:48,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:48,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:48,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:48,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:48,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:49,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:49,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:49,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:49,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:49,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:49,108 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 [2018-12-24 14:26:49,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:49,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:49,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:49,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:49,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:49,142 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 [2018-12-24 14:26:49,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:49,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:49,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:49,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:50,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:50,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-24 14:26:50,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:50,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 14:26:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 14:26:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:26:50,565 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2018-12-24 14:26:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:50,704 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-24 14:26:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 14:26:50,707 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2018-12-24 14:26:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:50,708 INFO L225 Difference]: With dead ends: 72 [2018-12-24 14:26:50,708 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 14:26:50,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 14:26:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 14:26:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-12-24 14:26:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-24 14:26:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-24 14:26:50,712 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-12-24 14:26:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:50,712 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-24 14:26:50,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 14:26:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-24 14:26:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-24 14:26:50,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:50,713 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2018-12-24 14:26:50,713 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2018-12-24 14:26:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:50,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:50,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:50,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:50,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:51,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:51,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:51,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:51,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:51,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:51,101 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 [2018-12-24 14:26:51,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:51,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:51,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:51,152 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 [2018-12-24 14:26:51,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:51,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:51,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:51,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:52,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:52,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-24 14:26:52,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:52,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 14:26:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 14:26:52,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 14:26:52,380 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2018-12-24 14:26:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:52,557 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-24 14:26:52,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 14:26:52,558 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2018-12-24 14:26:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:52,559 INFO L225 Difference]: With dead ends: 75 [2018-12-24 14:26:52,559 INFO L226 Difference]: Without dead ends: 74 [2018-12-24 14:26:52,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 14:26:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-24 14:26:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-12-24 14:26:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 14:26:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-24 14:26:52,564 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-12-24 14:26:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:52,565 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-24 14:26:52,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 14:26:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-24 14:26:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 14:26:52,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:52,566 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2018-12-24 14:26:52,566 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2018-12-24 14:26:52,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:52,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:52,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:52,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:52,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:52,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:52,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:52,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:52,941 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 [2018-12-24 14:26:52,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:52,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:52,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-24 14:26:52,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:53,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:53,003 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 [2018-12-24 14:26:53,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:53,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:53,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:53,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:54,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:54,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-24 14:26:54,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:54,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 14:26:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 14:26:54,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:26:54,258 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2018-12-24 14:26:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:54,421 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-24 14:26:54,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 14:26:54,421 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2018-12-24 14:26:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:54,422 INFO L225 Difference]: With dead ends: 78 [2018-12-24 14:26:54,422 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 14:26:54,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 14:26:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 14:26:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-24 14:26:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-24 14:26:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-24 14:26:54,427 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-12-24 14:26:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:54,428 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-24 14:26:54,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 14:26:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-24 14:26:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-24 14:26:54,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:54,429 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2018-12-24 14:26:54,429 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:54,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2018-12-24 14:26:54,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:54,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:54,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:54,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:54,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:54,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:54,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:54,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:54,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:54,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:54,825 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 [2018-12-24 14:26:54,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:26:54,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:26:54,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:26:54,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:54,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:54,868 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 [2018-12-24 14:26:54,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:54,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:54,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:55,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:56,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:56,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-24 14:26:56,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:56,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 14:26:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 14:26:56,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 14:26:56,491 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2018-12-24 14:26:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:56,686 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-24 14:26:56,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 14:26:56,687 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2018-12-24 14:26:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:56,688 INFO L225 Difference]: With dead ends: 81 [2018-12-24 14:26:56,688 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 14:26:56,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 14:26:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 14:26:56,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-12-24 14:26:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-24 14:26:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-24 14:26:56,694 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-12-24 14:26:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:56,695 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-24 14:26:56,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 14:26:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-24 14:26:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-24 14:26:56,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:56,696 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2018-12-24 14:26:56,696 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2018-12-24 14:26:56,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:56,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:56,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:26:56,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:56,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:57,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:57,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:57,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:57,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:57,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:57,117 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 [2018-12-24 14:26:57,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:57,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:26:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:57,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:57,154 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 [2018-12-24 14:26:57,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:57,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:57,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:26:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:57,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:58,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:26:58,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-24 14:26:58,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:26:58,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 14:26:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 14:26:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:26:58,879 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2018-12-24 14:26:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:59,107 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-24 14:26:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 14:26:59,107 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2018-12-24 14:26:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:59,108 INFO L225 Difference]: With dead ends: 84 [2018-12-24 14:26:59,109 INFO L226 Difference]: Without dead ends: 83 [2018-12-24 14:26:59,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 14:26:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-24 14:26:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-24 14:26:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-24 14:26:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-24 14:26:59,113 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-12-24 14:26:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:59,113 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-24 14:26:59,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 14:26:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-24 14:26:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-24 14:26:59,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:59,114 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2018-12-24 14:26:59,115 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2018-12-24 14:26:59,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:59,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:59,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:59,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:59,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:59,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:59,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:59,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:59,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:59,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:59,612 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 [2018-12-24 14:26:59,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:59,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:59,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-24 14:26:59,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:59,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:59,684 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 [2018-12-24 14:26:59,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:59,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:59,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:00,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:01,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:01,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-24 14:27:01,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:01,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 14:27:01,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 14:27:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 14:27:01,587 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2018-12-24 14:27:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:01,743 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-24 14:27:01,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 14:27:01,743 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2018-12-24 14:27:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:01,744 INFO L225 Difference]: With dead ends: 87 [2018-12-24 14:27:01,744 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 14:27:01,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 14:27:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 14:27:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-12-24 14:27:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 14:27:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-24 14:27:01,750 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-12-24 14:27:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:01,750 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-24 14:27:01,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 14:27:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-24 14:27:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 14:27:01,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:01,751 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2018-12-24 14:27:01,751 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2018-12-24 14:27:01,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:01,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:01,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:02,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:02,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:02,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:02,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:02,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:02,347 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 [2018-12-24 14:27:02,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:27:02,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:27:02,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:27:02,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:02,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:02,387 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 [2018-12-24 14:27:02,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:02,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:02,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:02,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:03,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:03,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-24 14:27:03,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:03,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 14:27:03,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 14:27:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:27:03,924 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2018-12-24 14:27:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:04,097 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-24 14:27:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 14:27:04,098 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2018-12-24 14:27:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:04,099 INFO L225 Difference]: With dead ends: 90 [2018-12-24 14:27:04,099 INFO L226 Difference]: Without dead ends: 89 [2018-12-24 14:27:04,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 14:27:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-24 14:27:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-24 14:27:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-24 14:27:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-24 14:27:04,104 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-12-24 14:27:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:04,105 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-24 14:27:04,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 14:27:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-24 14:27:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-24 14:27:04,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:04,105 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2018-12-24 14:27:04,106 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2018-12-24 14:27:04,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:04,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:04,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:04,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:04,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:04,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:04,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:04,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:04,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:04,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:04,978 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 [2018-12-24 14:27:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:04,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:27:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:05,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:05,032 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 [2018-12-24 14:27:05,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:05,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:05,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:06,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:07,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:07,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-24 14:27:07,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:07,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 14:27:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 14:27:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 14:27:07,171 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2018-12-24 14:27:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:07,379 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-24 14:27:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 14:27:07,380 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2018-12-24 14:27:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:07,381 INFO L225 Difference]: With dead ends: 93 [2018-12-24 14:27:07,381 INFO L226 Difference]: Without dead ends: 92 [2018-12-24 14:27:07,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 14:27:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-24 14:27:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-12-24 14:27:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 14:27:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-24 14:27:07,386 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-12-24 14:27:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:07,387 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-24 14:27:07,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 14:27:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-24 14:27:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-24 14:27:07,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:07,388 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2018-12-24 14:27:07,388 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2018-12-24 14:27:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:07,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:07,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:08,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:08,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:08,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:08,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:08,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:08,104 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 [2018-12-24 14:27:08,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:27:08,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:27:08,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-24 14:27:08,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:08,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:08,190 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 [2018-12-24 14:27:08,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:08,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:08,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:08,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:09,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:09,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-24 14:27:09,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:09,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 14:27:09,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 14:27:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:27:09,982 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2018-12-24 14:27:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:10,167 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-24 14:27:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 14:27:10,168 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2018-12-24 14:27:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:10,169 INFO L225 Difference]: With dead ends: 96 [2018-12-24 14:27:10,169 INFO L226 Difference]: Without dead ends: 95 [2018-12-24 14:27:10,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 14:27:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-24 14:27:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-24 14:27:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-24 14:27:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-24 14:27:10,174 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-12-24 14:27:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:10,175 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-24 14:27:10,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 14:27:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-24 14:27:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-24 14:27:10,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:10,175 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2018-12-24 14:27:10,175 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2018-12-24 14:27:10,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:10,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:10,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:10,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:11,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:11,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:11,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:11,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:11,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:11,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:27:11,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:27:11,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:27:11,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:27:11,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:11,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:11,056 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 [2018-12-24 14:27:11,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:11,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:11,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:11,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:12,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:12,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-24 14:27:12,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:12,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 14:27:12,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 14:27:12,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 14:27:12,946 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2018-12-24 14:27:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:13,137 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-24 14:27:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 14:27:13,138 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2018-12-24 14:27:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:13,139 INFO L225 Difference]: With dead ends: 99 [2018-12-24 14:27:13,139 INFO L226 Difference]: Without dead ends: 98 [2018-12-24 14:27:13,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 14:27:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-24 14:27:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-24 14:27:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 14:27:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-24 14:27:13,145 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-12-24 14:27:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:13,145 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-24 14:27:13,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 14:27:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-24 14:27:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 14:27:13,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:13,146 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2018-12-24 14:27:13,146 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:13,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2018-12-24 14:27:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:13,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:13,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:14,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:14,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:14,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:14,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:14,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:14,061 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 [2018-12-24 14:27:14,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:14,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:27:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:14,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:14,122 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 [2018-12-24 14:27:14,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:14,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:14,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:14,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:16,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:16,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-24 14:27:16,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:16,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 14:27:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 14:27:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:27:16,766 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2018-12-24 14:27:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:16,994 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-24 14:27:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 14:27:16,994 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2018-12-24 14:27:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:16,995 INFO L225 Difference]: With dead ends: 102 [2018-12-24 14:27:16,995 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 14:27:16,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 14:27:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 14:27:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-24 14:27:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-24 14:27:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-24 14:27:17,000 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-12-24 14:27:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:17,001 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-24 14:27:17,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 14:27:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-24 14:27:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-24 14:27:17,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:17,002 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2018-12-24 14:27:17,002 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:17,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2018-12-24 14:27:17,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:17,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:17,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:17,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:17,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:17,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:17,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:17,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:17,582 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 [2018-12-24 14:27:17,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:27:17,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:27:17,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-24 14:27:17,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:17,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:17,704 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 [2018-12-24 14:27:17,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:17,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:17,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:18,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:19,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:19,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-24 14:27:19,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:19,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 14:27:19,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 14:27:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 14:27:19,978 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2018-12-24 14:27:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:20,230 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-24 14:27:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 14:27:20,231 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2018-12-24 14:27:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:20,232 INFO L225 Difference]: With dead ends: 105 [2018-12-24 14:27:20,232 INFO L226 Difference]: Without dead ends: 104 [2018-12-24 14:27:20,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 14:27:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-24 14:27:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-12-24 14:27:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 14:27:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-24 14:27:20,238 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-12-24 14:27:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:20,239 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-24 14:27:20,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 14:27:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-24 14:27:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-24 14:27:20,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:20,240 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2018-12-24 14:27:20,240 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2018-12-24 14:27:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:20,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:20,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:21,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:21,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:21,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:21,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:21,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:21,180 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 [2018-12-24 14:27:21,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:27:21,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:27:21,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:27:21,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:21,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:21,250 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 [2018-12-24 14:27:21,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:21,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:21,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:22,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:23,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:23,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-24 14:27:23,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:23,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 14:27:23,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 14:27:23,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:27:23,568 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2018-12-24 14:27:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:23,823 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-24 14:27:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 14:27:23,823 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2018-12-24 14:27:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:23,824 INFO L225 Difference]: With dead ends: 108 [2018-12-24 14:27:23,824 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 14:27:23,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:27:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 14:27:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-24 14:27:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-24 14:27:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-24 14:27:23,830 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-12-24 14:27:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:23,831 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-24 14:27:23,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 14:27:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-24 14:27:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-24 14:27:23,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:23,831 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2018-12-24 14:27:23,832 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2018-12-24 14:27:23,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:23,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:23,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:24,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:24,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:24,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:24,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:24,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:24,523 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 [2018-12-24 14:27:24,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:24,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:27:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:24,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:24,570 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 [2018-12-24 14:27:24,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27: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. [2018-12-24 14:27:24,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:25,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:27,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:27,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-24 14:27:27,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:27,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 14:27:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 14:27:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 14:27:27,196 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2018-12-24 14:27:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:27,403 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-24 14:27:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 14:27:27,403 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2018-12-24 14:27:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:27,404 INFO L225 Difference]: With dead ends: 111 [2018-12-24 14:27:27,404 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 14:27:27,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 14:27:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 14:27:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-12-24 14:27:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 14:27:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-24 14:27:27,408 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-12-24 14:27:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:27,408 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-24 14:27:27,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 14:27:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-24 14:27:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 14:27:27,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:27,409 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2018-12-24 14:27:27,409 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2018-12-24 14:27:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:27,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:27,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:28,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:28,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:28,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:28,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:28,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:28,283 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 [2018-12-24 14:27:28,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:27:28,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:27:28,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-24 14:27:28,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:28,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:28,393 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 [2018-12-24 14:27:28,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:28,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:28,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:29,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:30,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:30,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-24 14:27:30,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:30,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 14:27:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 14:27:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:27:30,997 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2018-12-24 14:27:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:31,456 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-24 14:27:31,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 14:27:31,456 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2018-12-24 14:27:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:31,457 INFO L225 Difference]: With dead ends: 114 [2018-12-24 14:27:31,457 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 14:27:31,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 14:27:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 14:27:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-24 14:27:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-24 14:27:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-24 14:27:31,462 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-12-24 14:27:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:31,462 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-24 14:27:31,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 14:27:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-24 14:27:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-24 14:27:31,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:31,463 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2018-12-24 14:27:31,463 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:31,463 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2018-12-24 14:27:31,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:31,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:31,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:31,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:31,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:33,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:33,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:33,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:33,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:33,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:33,273 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 [2018-12-24 14:27:33,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:27:33,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:27:33,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:27:33,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:33,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:33,328 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 [2018-12-24 14:27:33,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:33,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:33,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:34,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:36,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:36,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-24 14:27:36,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:36,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 14:27:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 14:27:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 14:27:36,104 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2018-12-24 14:27:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:36,411 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-24 14:27:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 14:27:36,411 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2018-12-24 14:27:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:36,413 INFO L225 Difference]: With dead ends: 117 [2018-12-24 14:27:36,413 INFO L226 Difference]: Without dead ends: 116 [2018-12-24 14:27:36,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 14:27:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-24 14:27:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-12-24 14:27:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-24 14:27:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-24 14:27:36,419 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-12-24 14:27:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:36,419 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-24 14:27:36,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 14:27:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-24 14:27:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-24 14:27:36,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:36,420 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2018-12-24 14:27:36,420 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2018-12-24 14:27:36,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:36,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:36,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:36,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:37,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:37,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:37,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:37,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:37,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:37,241 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 [2018-12-24 14:27:37,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:37,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:27:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:37,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:37,307 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 [2018-12-24 14:27:37,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:37,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:37,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:38,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:40,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:40,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-24 14:27:40,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:40,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 14:27:40,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 14:27:40,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:27:40,213 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2018-12-24 14:27:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:40,556 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-24 14:27:40,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 14:27:40,556 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2018-12-24 14:27:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:40,558 INFO L225 Difference]: With dead ends: 120 [2018-12-24 14:27:40,558 INFO L226 Difference]: Without dead ends: 119 [2018-12-24 14:27:40,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 14:27:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-24 14:27:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-24 14:27:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-24 14:27:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-24 14:27:40,563 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-12-24 14:27:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:40,563 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-24 14:27:40,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 14:27:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-24 14:27:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-24 14:27:40,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:40,564 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2018-12-24 14:27:40,564 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:40,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2018-12-24 14:27:40,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:40,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:40,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:41,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:41,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:41,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:41,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:41,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:41,822 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 [2018-12-24 14:27:41,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:27:41,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:27:41,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-24 14:27:41,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:41,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:41,938 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 [2018-12-24 14:27:41,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:41,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:41,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:43,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:45,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:45,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-24 14:27:45,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:45,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 14:27:45,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 14:27:45,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 14:27:45,506 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2018-12-24 14:27:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:45,845 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-24 14:27:45,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 14:27:45,845 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2018-12-24 14:27:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:45,847 INFO L225 Difference]: With dead ends: 123 [2018-12-24 14:27:45,847 INFO L226 Difference]: Without dead ends: 122 [2018-12-24 14:27:45,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 14:27:45,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-24 14:27:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-12-24 14:27:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 14:27:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-12-24 14:27:45,852 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-12-24 14:27:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:45,853 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-12-24 14:27:45,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 14:27:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-12-24 14:27:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-24 14:27:45,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:45,853 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2018-12-24 14:27:45,854 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:45,854 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2018-12-24 14:27:45,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:45,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:45,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:47,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:47,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:47,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:47,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:47,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:47,082 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 [2018-12-24 14:27:47,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:27:47,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:27:47,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:27:47,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:47,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:47,172 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 [2018-12-24 14:27:47,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:47,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:47,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:48,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:50,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:50,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-24 14:27:50,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:50,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 14:27:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 14:27:50,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:27:50,953 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2018-12-24 14:27:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:51,259 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-12-24 14:27:51,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 14:27:51,259 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2018-12-24 14:27:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:51,260 INFO L225 Difference]: With dead ends: 126 [2018-12-24 14:27:51,260 INFO L226 Difference]: Without dead ends: 125 [2018-12-24 14:27:51,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 14:27:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-24 14:27:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-12-24 14:27:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-24 14:27:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-24 14:27:51,267 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-12-24 14:27:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:51,267 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-24 14:27:51,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 14:27:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-24 14:27:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-24 14:27:51,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:51,268 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2018-12-24 14:27:51,268 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2018-12-24 14:27:51,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:51,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:27:51,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:51,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:52,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:52,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:52,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:52,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:52,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:52,523 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 [2018-12-24 14:27:52,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:52,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:27:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:52,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:52,577 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 [2018-12-24 14:27:52,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:52,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:52,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:53,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:27:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:55,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:27:55,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-24 14:27:55,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:27:55,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 14:27:55,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 14:27:55,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 14:27:55,903 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2018-12-24 14:27:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:27:56,321 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-24 14:27:56,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 14:27:56,321 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2018-12-24 14:27:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:27:56,323 INFO L225 Difference]: With dead ends: 129 [2018-12-24 14:27:56,323 INFO L226 Difference]: Without dead ends: 128 [2018-12-24 14:27:56,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 14:27:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-24 14:27:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-12-24 14:27:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-24 14:27:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-12-24 14:27:56,329 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-12-24 14:27:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:27:56,330 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-12-24 14:27:56,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 14:27:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-12-24 14:27:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-24 14:27:56,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:27:56,331 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2018-12-24 14:27:56,331 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:27:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:27:56,331 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2018-12-24 14:27:56,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:27:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:56,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:27:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:27:56,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:27:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:27:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:57,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:57,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:27:57,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:27:57,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:27:57,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:27:57,565 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 [2018-12-24 14:27:57,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:27:57,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:27:57,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-24 14:27:57,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:27:57,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:27:57,709 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 [2018-12-24 14:27:57,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:27:57,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:27:57,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:27:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:27:58,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:01,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:01,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-24 14:28:01,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:01,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 14:28:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 14:28:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:28:01,060 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2018-12-24 14:28:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:01,439 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-12-24 14:28:01,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 14:28:01,439 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2018-12-24 14:28:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:01,441 INFO L225 Difference]: With dead ends: 132 [2018-12-24 14:28:01,441 INFO L226 Difference]: Without dead ends: 131 [2018-12-24 14:28:01,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 14:28:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-24 14:28:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-24 14:28:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-24 14:28:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-24 14:28:01,447 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-12-24 14:28:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:01,447 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-24 14:28:01,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 14:28:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-24 14:28:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-24 14:28:01,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:01,448 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2018-12-24 14:28:01,449 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:01,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:01,449 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2018-12-24 14:28:01,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:01,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:01,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:01,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:01,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:02,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:02,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:02,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:02,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:02,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:02,859 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 [2018-12-24 14:28:02,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:28:02,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:28:02,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:28:02,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:02,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:02,919 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 [2018-12-24 14:28:02,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:02,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:02,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:04,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:06,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:06,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-24 14:28:06,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:06,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 14:28:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 14:28:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 14:28:06,626 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2018-12-24 14:28:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:07,192 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-24 14:28:07,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 14:28:07,192 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2018-12-24 14:28:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:07,194 INFO L225 Difference]: With dead ends: 135 [2018-12-24 14:28:07,194 INFO L226 Difference]: Without dead ends: 134 [2018-12-24 14:28:07,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 14:28:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-24 14:28:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-12-24 14:28:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-24 14:28:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-12-24 14:28:07,200 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-12-24 14:28:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:07,201 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-12-24 14:28:07,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 14:28:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-12-24 14:28:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-24 14:28:07,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:07,202 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2018-12-24 14:28:07,202 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2018-12-24 14:28:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:07,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:07,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:15,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:15,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:15,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:15,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:15,027 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 [2018-12-24 14:28:15,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:15,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:15,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:15,085 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 [2018-12-24 14:28:15,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:15,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:15,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:16,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:18,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:18,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-24 14:28:18,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:18,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 14:28:18,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 14:28:18,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:28:18,967 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2018-12-24 14:28:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:19,228 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-12-24 14:28:19,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 14:28:19,229 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2018-12-24 14:28:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:19,230 INFO L225 Difference]: With dead ends: 138 [2018-12-24 14:28:19,230 INFO L226 Difference]: Without dead ends: 137 [2018-12-24 14:28:19,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 14:28:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-24 14:28:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-24 14:28:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-24 14:28:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-24 14:28:19,235 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-12-24 14:28:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:19,235 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-24 14:28:19,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 14:28:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-24 14:28:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-24 14:28:19,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:19,236 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2018-12-24 14:28:19,236 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2018-12-24 14:28:19,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:19,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:19,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:25,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:25,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:25,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:25,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:25,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:25,332 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 [2018-12-24 14:28:25,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:28:25,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:28:25,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-24 14:28:25,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:25,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:25,478 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 [2018-12-24 14:28:25,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:25,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:25,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:26,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:29,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:29,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-24 14:28:29,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:29,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 14:28:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 14:28:29,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 14:28:29,481 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2018-12-24 14:28:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:29,760 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-24 14:28:29,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 14:28:29,762 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2018-12-24 14:28:29,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:29,764 INFO L225 Difference]: With dead ends: 141 [2018-12-24 14:28:29,764 INFO L226 Difference]: Without dead ends: 140 [2018-12-24 14:28:29,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 14:28:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-24 14:28:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-12-24 14:28:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-24 14:28:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-12-24 14:28:29,771 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-12-24 14:28:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:29,772 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-12-24 14:28:29,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 14:28:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-12-24 14:28:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-24 14:28:29,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:29,773 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2018-12-24 14:28:29,773 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2018-12-24 14:28:29,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:29,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:29,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:32,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:32,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:32,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:32,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:32,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:32,239 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 [2018-12-24 14:28:32,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:28:32,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:28:32,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:28:32,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:32,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:32,315 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 [2018-12-24 14:28:32,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:32,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:32,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:33,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:36,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:36,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-24 14:28:36,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:36,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 14:28:36,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 14:28:36,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:28:36,770 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2018-12-24 14:28:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:37,221 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-12-24 14:28:37,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 14:28:37,226 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2018-12-24 14:28:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:37,227 INFO L225 Difference]: With dead ends: 144 [2018-12-24 14:28:37,227 INFO L226 Difference]: Without dead ends: 143 [2018-12-24 14:28:37,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 14:28:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-24 14:28:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-12-24 14:28:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-24 14:28:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-12-24 14:28:37,231 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-12-24 14:28:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:37,232 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-12-24 14:28:37,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 14:28:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-12-24 14:28:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-24 14:28:37,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:37,233 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2018-12-24 14:28:37,233 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:37,233 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2018-12-24 14:28:37,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:37,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:37,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:37,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:37,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:39,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:39,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:39,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:39,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:39,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:39,298 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 [2018-12-24 14:28:39,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:39,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:39,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:39,354 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 [2018-12-24 14:28:39,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:39,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:39,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:40,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:44,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:44,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-24 14:28:44,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:44,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 14:28:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 14:28:44,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 14:28:44,142 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2018-12-24 14:28:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:44,463 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-24 14:28:44,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 14:28:44,464 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2018-12-24 14:28:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:44,465 INFO L225 Difference]: With dead ends: 147 [2018-12-24 14:28:44,465 INFO L226 Difference]: Without dead ends: 146 [2018-12-24 14:28:44,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 14:28:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-24 14:28:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-12-24 14:28:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-24 14:28:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-12-24 14:28:44,471 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-12-24 14:28:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:44,472 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-12-24 14:28:44,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 14:28:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-12-24 14:28:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-24 14:28:44,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:44,473 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2018-12-24 14:28:44,473 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2018-12-24 14:28:44,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:44,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:44,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:44,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:44,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:46,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:46,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:46,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:46,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:46,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:46,317 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 [2018-12-24 14:28:46,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:28:46,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:28:46,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-24 14:28:46,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:46,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:46,522 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 [2018-12-24 14:28:46,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:46,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:48,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:51,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:51,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-24 14:28:51,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:51,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 14:28:51,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 14:28:51,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:28:51,150 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2018-12-24 14:28:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:51,499 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-12-24 14:28:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 14:28:51,499 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2018-12-24 14:28:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:51,501 INFO L225 Difference]: With dead ends: 150 [2018-12-24 14:28:51,501 INFO L226 Difference]: Without dead ends: 149 [2018-12-24 14:28:51,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 14:28:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-24 14:28:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-12-24 14:28:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-24 14:28:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-12-24 14:28:51,507 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-12-24 14:28:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:51,508 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-12-24 14:28:51,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 14:28:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-12-24 14:28:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-24 14:28:51,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:51,509 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2018-12-24 14:28:51,511 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2018-12-24 14:28:51,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:51,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:51,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:51,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:51,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:52,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:52,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:52,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:52,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:52,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:52,723 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 [2018-12-24 14:28:52,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:28:52,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:28:52,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:28:52,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:28:52,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:52,804 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 [2018-12-24 14:28:52,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:52,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:28:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:54,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:28:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:57,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:28:57,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-24 14:28:57,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:28:57,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 14:28:57,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 14:28:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 14:28:57,475 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2018-12-24 14:28:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:28:57,861 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-24 14:28:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 14:28:57,861 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2018-12-24 14:28:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:28:57,862 INFO L225 Difference]: With dead ends: 153 [2018-12-24 14:28:57,862 INFO L226 Difference]: Without dead ends: 152 [2018-12-24 14:28:57,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 14:28:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-24 14:28:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-12-24 14:28:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-24 14:28:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-12-24 14:28:57,871 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-12-24 14:28:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:28:57,871 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-12-24 14:28:57,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 14:28:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-12-24 14:28:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-24 14:28:57,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:28:57,872 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2018-12-24 14:28:57,872 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:28:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:28:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2018-12-24 14:28:57,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:28:57,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:57,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:28:57,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:28:57,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:28:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:28:59,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:59,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:28:59,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:28:59,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:28:59,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:28:59,484 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 [2018-12-24 14:28:59,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:28:59,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:28:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:28:59,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:28:59,546 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 [2018-12-24 14:28:59,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:28:59,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:01,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:04,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:04,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-24 14:29:04,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:04,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 14:29:04,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 14:29:04,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:29:04,446 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2018-12-24 14:29:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:04,789 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-12-24 14:29:04,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 14:29:04,789 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2018-12-24 14:29:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:04,791 INFO L225 Difference]: With dead ends: 156 [2018-12-24 14:29:04,791 INFO L226 Difference]: Without dead ends: 155 [2018-12-24 14:29:04,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 14:29:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-24 14:29:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-12-24 14:29:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-24 14:29:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-12-24 14:29:04,797 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-12-24 14:29:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:04,797 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-12-24 14:29:04,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 14:29:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-12-24 14:29:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-24 14:29:04,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:04,798 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2018-12-24 14:29:04,798 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:04,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:04,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2018-12-24 14:29:04,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:04,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:04,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:04,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:06,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:06,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:06,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:06,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:06,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:06,265 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 [2018-12-24 14:29:06,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:06,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:06,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-24 14:29:06,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:06,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:06,439 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 [2018-12-24 14:29:06,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:06,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:06,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:07,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:11,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:11,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2018-12-24 14:29:11,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:11,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 14:29:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 14:29:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2018-12-24 14:29:11,693 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2018-12-24 14:29:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:12,044 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-24 14:29:12,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 14:29:12,045 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2018-12-24 14:29:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:12,046 INFO L225 Difference]: With dead ends: 159 [2018-12-24 14:29:12,046 INFO L226 Difference]: Without dead ends: 158 [2018-12-24 14:29:12,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2018-12-24 14:29:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-24 14:29:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-12-24 14:29:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-24 14:29:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-12-24 14:29:12,052 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-12-24 14:29:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:12,052 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-12-24 14:29:12,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 14:29:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-12-24 14:29:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-24 14:29:12,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:12,053 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2018-12-24 14:29:12,054 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2018-12-24 14:29:12,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:12,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:12,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:12,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:12,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:13,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:13,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:13,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:13,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:13,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:13,906 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 [2018-12-24 14:29:13,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:29:13,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:29:13,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:29:13,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:13,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:13,984 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 [2018-12-24 14:29:13,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:14,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:16,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:20,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:20,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2018-12-24 14:29:20,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:20,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 14:29:20,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 14:29:20,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:29:20,086 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2018-12-24 14:29:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:20,545 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-12-24 14:29:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 14:29:20,546 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2018-12-24 14:29:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:20,547 INFO L225 Difference]: With dead ends: 162 [2018-12-24 14:29:20,547 INFO L226 Difference]: Without dead ends: 161 [2018-12-24 14:29:20,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 14:29:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-24 14:29:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-12-24 14:29:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-24 14:29:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-12-24 14:29:20,554 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-12-24 14:29:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:20,554 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-12-24 14:29:20,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 14:29:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-12-24 14:29:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-24 14:29:20,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:20,555 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2018-12-24 14:29:20,555 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:20,555 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2018-12-24 14:29:20,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:20,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:20,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:20,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:20,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:21,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:21,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:21,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:21,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:21,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:21,944 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 [2018-12-24 14:29:21,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:21,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:22,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:22,005 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 [2018-12-24 14:29:22,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:22,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:22,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:23,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:27,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:27,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2018-12-24 14:29:27,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:27,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-24 14:29:27,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-24 14:29:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 14:29:27,247 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2018-12-24 14:29:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:27,663 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-24 14:29:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 14:29:27,663 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2018-12-24 14:29:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:27,664 INFO L225 Difference]: With dead ends: 165 [2018-12-24 14:29:27,664 INFO L226 Difference]: Without dead ends: 164 [2018-12-24 14:29:27,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 14:29:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-24 14:29:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-12-24 14:29:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-24 14:29:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-12-24 14:29:27,671 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-12-24 14:29:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:27,671 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-12-24 14:29:27,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-24 14:29:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-12-24 14:29:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-24 14:29:27,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:27,672 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2018-12-24 14:29:27,672 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:27,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:27,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2018-12-24 14:29:27,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:27,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:27,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:29,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:29,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:29,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:29,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:29,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:29,461 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 [2018-12-24 14:29:29,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:29,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:29,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-24 14:29:29,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:29,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:29,661 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 [2018-12-24 14:29:29,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:29,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:29,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:32,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:36,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:36,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2018-12-24 14:29:36,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:36,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-24 14:29:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-24 14:29:36,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:29:36,219 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2018-12-24 14:29:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:36,638 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-12-24 14:29:36,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 14:29:36,639 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2018-12-24 14:29:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:36,640 INFO L225 Difference]: With dead ends: 168 [2018-12-24 14:29:36,640 INFO L226 Difference]: Without dead ends: 167 [2018-12-24 14:29:36,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 14:29:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-24 14:29:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-12-24 14:29:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-24 14:29:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-12-24 14:29:36,646 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2018-12-24 14:29:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:36,646 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-12-24 14:29:36,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-24 14:29:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-12-24 14:29:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-24 14:29:36,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:36,647 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2018-12-24 14:29:36,647 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:36,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2018-12-24 14:29:36,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:36,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:36,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:36,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:36,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:38,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:38,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:38,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:38,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:38,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:38,086 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 [2018-12-24 14:29:38,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:29:38,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:29:38,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:29:38,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:38,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:38,175 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 [2018-12-24 14:29:38,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:38,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:40,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:43,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:43,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2018-12-24 14:29:43,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:43,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-24 14:29:43,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-24 14:29:43,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 14:29:43,779 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2018-12-24 14:29:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:44,161 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-24 14:29:44,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 14:29:44,162 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2018-12-24 14:29:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:44,163 INFO L225 Difference]: With dead ends: 171 [2018-12-24 14:29:44,163 INFO L226 Difference]: Without dead ends: 170 [2018-12-24 14:29:44,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 14:29:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-24 14:29:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-12-24 14:29:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-24 14:29:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-12-24 14:29:44,169 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2018-12-24 14:29:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:44,170 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-12-24 14:29:44,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-24 14:29:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-12-24 14:29:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-24 14:29:44,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:44,171 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2018-12-24 14:29:44,171 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:44,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2018-12-24 14:29:44,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:44,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:44,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:44,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:44,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:45,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:45,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:45,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:45,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:45,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:45,745 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 [2018-12-24 14:29:45,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:45,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:29:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:45,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:45,814 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 [2018-12-24 14:29:45,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:45,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:45,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:47,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:51,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2018-12-24 14:29:51,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:51,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-24 14:29:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-24 14:29:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:29:51,402 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2018-12-24 14:29:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:51,792 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-12-24 14:29:51,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 14:29:51,792 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2018-12-24 14:29:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:51,794 INFO L225 Difference]: With dead ends: 174 [2018-12-24 14:29:51,794 INFO L226 Difference]: Without dead ends: 173 [2018-12-24 14:29:51,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 14:29:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-24 14:29:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-24 14:29:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-24 14:29:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-12-24 14:29:51,799 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2018-12-24 14:29:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:51,799 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-12-24 14:29:51,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-24 14:29:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-12-24 14:29:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-24 14:29:51,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:51,800 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2018-12-24 14:29:51,801 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:51,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:51,801 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2018-12-24 14:29:51,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:51,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:29:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:51,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:29:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:53,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:29:53,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:29:53,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:29:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:29:53,448 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 [2018-12-24 14:29:53,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:29:53,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:29:53,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-24 14:29:53,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:29:53,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:29:53,677 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 [2018-12-24 14:29:53,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:29:53,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:29:53,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:29:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:55,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:29:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:29:59,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:29:59,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2018-12-24 14:29:59,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:29:59,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-24 14:29:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-24 14:29:59,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 14:29:59,408 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2018-12-24 14:29:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:29:59,920 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-24 14:29:59,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 14:29:59,921 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2018-12-24 14:29:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:29:59,922 INFO L225 Difference]: With dead ends: 177 [2018-12-24 14:29:59,922 INFO L226 Difference]: Without dead ends: 176 [2018-12-24 14:29:59,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 14:29:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-24 14:29:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-12-24 14:29:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-24 14:29:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-12-24 14:29:59,926 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2018-12-24 14:29:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:29:59,927 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-12-24 14:29:59,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-24 14:29:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-12-24 14:29:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-24 14:29:59,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:29:59,928 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2018-12-24 14:29:59,928 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:29:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:29:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2018-12-24 14:29:59,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:29:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:59,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:29:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:29:59,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:29:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:01,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:01,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:30:01,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:30:01,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:30:01,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:01,706 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 [2018-12-24 14:30:01,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:30:01,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:30:01,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:30:01,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:30:01,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:30:01,786 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 [2018-12-24 14:30:01,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:30:01,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:30:01,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:30:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:03,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:30:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:07,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:30:07,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2018-12-24 14:30:07,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:30:07,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-24 14:30:07,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-24 14:30:07,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:30:07,609 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2018-12-24 14:30:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:30:08,069 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-12-24 14:30:08,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 14:30:08,069 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2018-12-24 14:30:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:30:08,070 INFO L225 Difference]: With dead ends: 180 [2018-12-24 14:30:08,071 INFO L226 Difference]: Without dead ends: 179 [2018-12-24 14:30:08,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 230 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 14:30:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-24 14:30:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-12-24 14:30:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-24 14:30:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-12-24 14:30:08,076 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2018-12-24 14:30:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:30:08,076 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-12-24 14:30:08,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-24 14:30:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-12-24 14:30:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-24 14:30:08,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:30:08,077 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2018-12-24 14:30:08,077 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:30:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:30:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2018-12-24 14:30:08,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:30:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:08,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:30:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:08,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:30:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:09,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:09,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:30:09,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:30:09,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:30:09,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:09,737 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 [2018-12-24 14:30:09,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:30:09,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:30:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:09,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:30:09,812 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 [2018-12-24 14:30:09,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:30:09,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:30:09,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:30:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:12,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:30:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:15,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:30:15,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2018-12-24 14:30:15,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:30:15,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-24 14:30:15,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-24 14:30:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 14:30:15,710 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2018-12-24 14:30:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:30:16,119 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-24 14:30:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 14:30:16,120 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2018-12-24 14:30:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:30:16,121 INFO L225 Difference]: With dead ends: 183 [2018-12-24 14:30:16,121 INFO L226 Difference]: Without dead ends: 182 [2018-12-24 14:30:16,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 14:30:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-24 14:30:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-12-24 14:30:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-24 14:30:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-12-24 14:30:16,127 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2018-12-24 14:30:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:30:16,127 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-12-24 14:30:16,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-24 14:30:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-12-24 14:30:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-24 14:30:16,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:30:16,128 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2018-12-24 14:30:16,129 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:30:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:30:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2018-12-24 14:30:16,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:30:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:16,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:30:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:16,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:30:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:17,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:17,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:30:17,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:30:17,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:30:17,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:17,922 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 [2018-12-24 14:30:17,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:30:17,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:30:18,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-24 14:30:18,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:30:18,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:30:18,520 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 [2018-12-24 14:30:18,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:30:18,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:30:18,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:30:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:20,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:30:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:24,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:30:24,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2018-12-24 14:30:24,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:30:24,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-24 14:30:24,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-24 14:30:24,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:30:24,397 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2018-12-24 14:30:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:30:24,796 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-12-24 14:30:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 14:30:24,797 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2018-12-24 14:30:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:30:24,798 INFO L225 Difference]: With dead ends: 186 [2018-12-24 14:30:24,799 INFO L226 Difference]: Without dead ends: 185 [2018-12-24 14:30:24,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 14:30:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-24 14:30:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-12-24 14:30:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-24 14:30:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-12-24 14:30:24,805 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2018-12-24 14:30:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:30:24,806 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-12-24 14:30:24,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-24 14:30:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-12-24 14:30:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-24 14:30:24,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:30:24,807 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2018-12-24 14:30:24,807 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:30:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:30:24,807 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2018-12-24 14:30:24,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:30:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:24,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:30:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:24,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:30:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:26,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:26,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:30:26,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:30:26,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:30:26,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:26,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:30:26,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:30:26,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:30:26,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:30:26,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:30:26,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:30:26,750 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 [2018-12-24 14:30:26,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:30:26,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:30:26,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:30:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:29,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:30:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:32,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:30:32,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2018-12-24 14:30:32,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:30:32,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-24 14:30:32,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-24 14:30:32,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 14:30:32,852 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2018-12-24 14:30:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:30:33,323 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-24 14:30:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 14:30:33,324 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2018-12-24 14:30:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:30:33,325 INFO L225 Difference]: With dead ends: 189 [2018-12-24 14:30:33,325 INFO L226 Difference]: Without dead ends: 188 [2018-12-24 14:30:33,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 242 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 14:30:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-24 14:30:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-12-24 14:30:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-24 14:30:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-12-24 14:30:33,330 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2018-12-24 14:30:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:30:33,331 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-12-24 14:30:33,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-24 14:30:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-12-24 14:30:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-24 14:30:33,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:30:33,331 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2018-12-24 14:30:33,332 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:30:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:30:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2018-12-24 14:30:33,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:30:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:33,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:30:33,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:33,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:30:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:35,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:35,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:30:35,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:30:35,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:30:35,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:35,208 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 [2018-12-24 14:30:35,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:30:35,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:30:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:35,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:30:35,281 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 [2018-12-24 14:30:35,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:30:35,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:30:35,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:30:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:37,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:30:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:41,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:30:41,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2018-12-24 14:30:41,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:30:41,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-24 14:30:41,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-24 14:30:41,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:30:41,674 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2018-12-24 14:30:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:30:42,171 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-12-24 14:30:42,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 14:30:42,171 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2018-12-24 14:30:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:30:42,172 INFO L225 Difference]: With dead ends: 192 [2018-12-24 14:30:42,172 INFO L226 Difference]: Without dead ends: 191 [2018-12-24 14:30:42,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 246 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 14:30:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-24 14:30:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-12-24 14:30:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-24 14:30:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-12-24 14:30:42,178 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2018-12-24 14:30:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:30:42,178 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-12-24 14:30:42,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-24 14:30:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-12-24 14:30:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-24 14:30:42,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:30:42,179 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2018-12-24 14:30:42,179 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:30:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:30:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2018-12-24 14:30:42,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:30:42,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:42,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:30:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:42,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:30:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:44,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:44,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:30:44,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:30:44,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:30:44,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:44,036 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 [2018-12-24 14:30:44,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:30:44,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:30:44,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-24 14:30:44,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:30:44,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:30:44,292 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 [2018-12-24 14:30:44,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:30:44,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:30:44,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:30:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:46,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:30:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:50,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:30:50,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2018-12-24 14:30:50,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:30:50,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-24 14:30:50,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-24 14:30:50,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 14:30:50,460 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2018-12-24 14:30:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:30:51,065 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-24 14:30:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 14:30:51,065 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2018-12-24 14:30:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:30:51,066 INFO L225 Difference]: With dead ends: 195 [2018-12-24 14:30:51,066 INFO L226 Difference]: Without dead ends: 194 [2018-12-24 14:30:51,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 250 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 14:30:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-24 14:30:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-12-24 14:30:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-24 14:30:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-12-24 14:30:51,072 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2018-12-24 14:30:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:30:51,072 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-12-24 14:30:51,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-24 14:30:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-12-24 14:30:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-24 14:30:51,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:30:51,073 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2018-12-24 14:30:51,074 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:30:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:30:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2018-12-24 14:30:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:30:51,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:51,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:30:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:51,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:30:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:30:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:53,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:53,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:30:53,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:30:53,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:30:53,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:30:53,028 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 [2018-12-24 14:30:53,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:30:53,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:30:53,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:30:53,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:30:53,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:30:53,118 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 [2018-12-24 14:30:53,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:30:53,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:30:53,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:30:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:55,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:30:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:30:59,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:30:59,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2018-12-24 14:30:59,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:30:59,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-24 14:30:59,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-24 14:30:59,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:30:59,446 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2018-12-24 14:30:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:30:59,981 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-12-24 14:30:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 14:30:59,982 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2018-12-24 14:30:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:30:59,983 INFO L225 Difference]: With dead ends: 198 [2018-12-24 14:30:59,983 INFO L226 Difference]: Without dead ends: 197 [2018-12-24 14:30:59,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 254 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 14:30:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-24 14:30:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-12-24 14:30:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-24 14:30:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-12-24 14:30:59,990 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2018-12-24 14:30:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:30:59,990 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-12-24 14:30:59,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-24 14:30:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-12-24 14:30:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-24 14:30:59,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:30:59,992 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2018-12-24 14:30:59,992 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:30:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:30:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2018-12-24 14:30:59,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:30:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:59,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:30:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:30:59,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:31:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:02,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:02,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:31:02,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:31:02,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:31:02,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:02,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:31:02,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:31:02,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:31:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:02,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:31:02,115 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 [2018-12-24 14:31:02,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:31:02,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:31:02,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:31:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:04,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:31:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:08,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:31:08,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2018-12-24 14:31:08,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:31:08,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-24 14:31:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-24 14:31:08,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 14:31:08,573 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2018-12-24 14:31:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:31:09,061 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-12-24 14:31:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 14:31:09,061 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2018-12-24 14:31:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:31:09,062 INFO L225 Difference]: With dead ends: 201 [2018-12-24 14:31:09,062 INFO L226 Difference]: Without dead ends: 200 [2018-12-24 14:31:09,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 258 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 14:31:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-24 14:31:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-12-24 14:31:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-24 14:31:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-12-24 14:31:09,070 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2018-12-24 14:31:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:31:09,070 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-12-24 14:31:09,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-24 14:31:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-12-24 14:31:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-24 14:31:09,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:31:09,071 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2018-12-24 14:31:09,072 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:31:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:31:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2018-12-24 14:31:09,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:31:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:09,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:31:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:09,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:31:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:11,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:11,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:31:11,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:31:11,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:31:11,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:11,210 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 [2018-12-24 14:31:11,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:31:11,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:31:11,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-24 14:31:11,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:31:11,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:31:11,515 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 [2018-12-24 14:31:11,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:31:11,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:31:11,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:31:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:14,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:31:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:18,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:31:18,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2018-12-24 14:31:18,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:31:18,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-24 14:31:18,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-24 14:31:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:31:18,199 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2018-12-24 14:31:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:31:18,672 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-12-24 14:31:18,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 14:31:18,673 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2018-12-24 14:31:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:31:18,674 INFO L225 Difference]: With dead ends: 204 [2018-12-24 14:31:18,674 INFO L226 Difference]: Without dead ends: 203 [2018-12-24 14:31:18,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 14:31:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-24 14:31:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-24 14:31:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-24 14:31:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-12-24 14:31:18,679 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2018-12-24 14:31:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:31:18,679 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-12-24 14:31:18,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-24 14:31:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-12-24 14:31:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-24 14:31:18,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:31:18,680 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2018-12-24 14:31:18,680 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:31:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:31:18,681 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2018-12-24 14:31:18,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:31:18,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:18,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:31:18,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:18,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:31:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:20,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:20,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:31:20,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:31:20,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:31:20,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:20,820 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 [2018-12-24 14:31:20,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:31:20,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:31:20,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:31:20,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:31:20,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:31:20,913 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 [2018-12-24 14:31:20,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:31:20,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:31:20,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:31:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:23,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:31:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:27,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:31:27,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2018-12-24 14:31:27,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:31:27,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-24 14:31:27,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-24 14:31:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 14:31:27,844 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2018-12-24 14:31:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:31:28,379 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-12-24 14:31:28,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 14:31:28,380 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2018-12-24 14:31:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:31:28,381 INFO L225 Difference]: With dead ends: 207 [2018-12-24 14:31:28,381 INFO L226 Difference]: Without dead ends: 206 [2018-12-24 14:31:28,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 266 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 14:31:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-24 14:31:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-12-24 14:31:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-24 14:31:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-12-24 14:31:28,386 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2018-12-24 14:31:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:31:28,387 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-12-24 14:31:28,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-24 14:31:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-12-24 14:31:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-24 14:31:28,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:31:28,388 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2018-12-24 14:31:28,388 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:31:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:31:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2018-12-24 14:31:28,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:31:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:28,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:31:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:28,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:31:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:30,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:30,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:31:30,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:31:30,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:31:30,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:30,567 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 [2018-12-24 14:31:30,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:31:30,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:31:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:30,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:31:30,647 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 [2018-12-24 14:31:30,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:31:30,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:31:30,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:31:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:33,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:31:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:37,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:31:37,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2018-12-24 14:31:37,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:31:37,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-24 14:31:37,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-24 14:31:37,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:31:37,153 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2018-12-24 14:31:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:31:37,606 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-12-24 14:31:37,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 14:31:37,607 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2018-12-24 14:31:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:31:37,608 INFO L225 Difference]: With dead ends: 210 [2018-12-24 14:31:37,608 INFO L226 Difference]: Without dead ends: 209 [2018-12-24 14:31:37,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 270 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 14:31:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-24 14:31:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-12-24 14:31:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-24 14:31:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-12-24 14:31:37,613 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2018-12-24 14:31:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:31:37,614 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-12-24 14:31:37,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-24 14:31:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-12-24 14:31:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-24 14:31:37,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:31:37,615 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2018-12-24 14:31:37,615 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:31:37,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:31:37,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2018-12-24 14:31:37,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:31:37,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:37,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:31:37,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:37,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:31:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:39,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:39,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:31:39,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:31:39,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:31:39,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:39,851 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 [2018-12-24 14:31:39,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:31:39,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:31:40,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-24 14:31:40,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:31:40,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:31:40,172 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 [2018-12-24 14:31:40,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:31:40,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:31:40,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:31:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:43,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:31:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:47,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:31:47,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2018-12-24 14:31:47,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:31:47,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-24 14:31:47,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-24 14:31:47,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 14:31:47,075 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2018-12-24 14:31:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:31:47,716 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-12-24 14:31:47,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 14:31:47,716 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2018-12-24 14:31:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:31:47,718 INFO L225 Difference]: With dead ends: 213 [2018-12-24 14:31:47,718 INFO L226 Difference]: Without dead ends: 212 [2018-12-24 14:31:47,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 274 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 14:31:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-24 14:31:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-12-24 14:31:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-24 14:31:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-12-24 14:31:47,725 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2018-12-24 14:31:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:31:47,726 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-12-24 14:31:47,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-24 14:31:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-12-24 14:31:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-24 14:31:47,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:31:47,727 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2018-12-24 14:31:47,727 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:31:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:31:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2018-12-24 14:31:47,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:31:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:47,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:31:47,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:47,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:31:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:50,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:50,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:31:50,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:31:50,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:31:50,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:50,074 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 [2018-12-24 14:31:50,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:31:50,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:31:50,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:31:50,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:31:50,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:31:50,182 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 [2018-12-24 14:31:50,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:31:50,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:31:50,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:31:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:53,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:31:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:56,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:31:56,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2018-12-24 14:31:56,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:31:56,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-24 14:31:56,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-24 14:31:56,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:31:56,934 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2018-12-24 14:31:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:31:57,523 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-12-24 14:31:57,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 14:31:57,523 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2018-12-24 14:31:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:31:57,525 INFO L225 Difference]: With dead ends: 216 [2018-12-24 14:31:57,525 INFO L226 Difference]: Without dead ends: 215 [2018-12-24 14:31:57,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 278 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 14:31:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-24 14:31:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-12-24 14:31:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-24 14:31:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-12-24 14:31:57,532 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2018-12-24 14:31:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:31:57,533 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-12-24 14:31:57,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-24 14:31:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-12-24 14:31:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-24 14:31:57,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:31:57,534 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2018-12-24 14:31:57,534 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:31:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:31:57,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2018-12-24 14:31:57,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:31:57,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:57,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:31:57,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:31:57,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:31:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:31:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:31:59,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:59,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:31:59,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:31:59,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:31:59,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:31:59,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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:31:59,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:31:59,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:31:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:32:00,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:32:00,009 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 [2018-12-24 14:32:00,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:32:00,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:32:00,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:32:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:02,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:32:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:06,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:32:06,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2018-12-24 14:32:06,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:32:06,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-24 14:32:06,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-24 14:32:06,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 14:32:06,948 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2018-12-24 14:32:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:32:07,425 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-12-24 14:32:07,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 14:32:07,426 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2018-12-24 14:32:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:32:07,427 INFO L225 Difference]: With dead ends: 219 [2018-12-24 14:32:07,427 INFO L226 Difference]: Without dead ends: 218 [2018-12-24 14:32:07,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 14:32:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-24 14:32:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-12-24 14:32:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-24 14:32:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-12-24 14:32:07,433 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2018-12-24 14:32:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:32:07,433 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-12-24 14:32:07,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-24 14:32:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-12-24 14:32:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-24 14:32:07,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:32:07,434 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2018-12-24 14:32:07,435 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:32:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:32:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2018-12-24 14:32:07,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:32:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:07,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:32:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:07,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:32:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:32:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:09,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:09,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:32:09,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:32:09,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:32:09,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:09,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:32:09,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:32:09,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:32:10,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-24 14:32:10,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:32:10,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:32:10,316 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 [2018-12-24 14:32:10,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:32:10,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:32:10,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:32:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:13,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:32:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:17,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:32:17,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2018-12-24 14:32:17,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:32:17,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-24 14:32:17,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-24 14:32:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:32:17,280 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2018-12-24 14:32:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:32:17,816 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-12-24 14:32:17,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 14:32:17,816 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2018-12-24 14:32:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:32:17,818 INFO L225 Difference]: With dead ends: 222 [2018-12-24 14:32:17,818 INFO L226 Difference]: Without dead ends: 221 [2018-12-24 14:32:17,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 286 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 14:32:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-24 14:32:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-12-24 14:32:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-24 14:32:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-12-24 14:32:17,824 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2018-12-24 14:32:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:32:17,824 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-12-24 14:32:17,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-24 14:32:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-12-24 14:32:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-24 14:32:17,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:32:17,825 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2018-12-24 14:32:17,825 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:32:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:32:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2018-12-24 14:32:17,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:32:17,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:17,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:32:17,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:17,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:32:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:32:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:20,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:20,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:32:20,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:32:20,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:32:20,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:20,352 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 [2018-12-24 14:32:20,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:32:20,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:32:20,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:32:20,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:32:20,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:32:20,448 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 [2018-12-24 14:32:20,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:32:20,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:32:20,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:32:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:23,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:32:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:27,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:32:27,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2018-12-24 14:32:27,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:32:27,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-24 14:32:27,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-24 14:32:27,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 14:32:27,235 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2018-12-24 14:32:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:32:27,703 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-12-24 14:32:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 14:32:27,703 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2018-12-24 14:32:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:32:27,705 INFO L225 Difference]: With dead ends: 225 [2018-12-24 14:32:27,705 INFO L226 Difference]: Without dead ends: 224 [2018-12-24 14:32:27,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 290 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 14:32:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-12-24 14:32:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2018-12-24 14:32:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-24 14:32:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-12-24 14:32:27,711 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2018-12-24 14:32:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:32:27,711 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-12-24 14:32:27,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-24 14:32:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-12-24 14:32:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-24 14:32:27,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:32:27,712 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2018-12-24 14:32:27,712 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:32:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:32:27,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2018-12-24 14:32:27,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:32:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:27,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:32:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:27,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:32:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:32:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:30,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:30,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:32:30,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:32:30,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:32:30,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:30,261 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 [2018-12-24 14:32:30,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:32:30,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:32:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:32:30,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:32:30,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 [2018-12-24 14:32:30,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:32:30,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:32:30,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:32:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:33,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:32:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:37,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:32:37,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2018-12-24 14:32:37,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:32:37,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-24 14:32:37,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-24 14:32:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:32:37,360 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2018-12-24 14:32:37,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:32:37,874 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-12-24 14:32:37,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 14:32:37,874 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2018-12-24 14:32:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:32:37,875 INFO L225 Difference]: With dead ends: 228 [2018-12-24 14:32:37,876 INFO L226 Difference]: Without dead ends: 227 [2018-12-24 14:32:37,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 14:32:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-24 14:32:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-12-24 14:32:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-24 14:32:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-12-24 14:32:37,883 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2018-12-24 14:32:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:32:37,883 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-12-24 14:32:37,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-24 14:32:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-12-24 14:32:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-24 14:32:37,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:32:37,885 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2018-12-24 14:32:37,885 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:32:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:32:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2018-12-24 14:32:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:32:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:37,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:32:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:37,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:32:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:32:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:40,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:40,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:32:40,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:32:40,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:32:40,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:40,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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:32:40,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:32:40,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:32:40,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-24 14:32:40,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:32:40,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:32:40,820 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 [2018-12-24 14:32:40,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:32:40,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:32:40,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:32:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:43,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:32:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:47,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:32:47,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2018-12-24 14:32:47,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:32:47,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-24 14:32:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-24 14:32:47,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 14:32:47,827 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2018-12-24 14:32:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:32:48,382 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-12-24 14:32:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 14:32:48,383 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2018-12-24 14:32:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:32:48,384 INFO L225 Difference]: With dead ends: 231 [2018-12-24 14:32:48,384 INFO L226 Difference]: Without dead ends: 230 [2018-12-24 14:32:48,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 298 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 14:32:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-24 14:32:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-12-24 14:32:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-24 14:32:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-12-24 14:32:48,392 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2018-12-24 14:32:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:32:48,392 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-12-24 14:32:48,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-24 14:32:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-12-24 14:32:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-24 14:32:48,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:32:48,393 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2018-12-24 14:32:48,394 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:32:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:32:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2018-12-24 14:32:48,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:32:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:48,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:32:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:48,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:32:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:32:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:51,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:51,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:32:51,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:32:51,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:32:51,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:32:51,069 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 [2018-12-24 14:32:51,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:32:51,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:32:51,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:32:51,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:32:51,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:32:51,166 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 [2018-12-24 14:32:51,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:32:51,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:32:51,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:32:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:54,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:32:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:32:58,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:32:58,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2018-12-24 14:32:58,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:32:58,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-24 14:32:58,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-24 14:32:58,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:32:58,234 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2018-12-24 14:32:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:32:58,899 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-12-24 14:32:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 14:32:58,900 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2018-12-24 14:32:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:32:58,901 INFO L225 Difference]: With dead ends: 234 [2018-12-24 14:32:58,901 INFO L226 Difference]: Without dead ends: 233 [2018-12-24 14:32:58,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 302 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 14:32:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-24 14:32:58,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2018-12-24 14:32:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-24 14:32:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-12-24 14:32:58,908 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2018-12-24 14:32:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:32:58,909 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-12-24 14:32:58,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-24 14:32:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-12-24 14:32:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-24 14:32:58,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:32:58,910 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2018-12-24 14:32:58,910 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:32:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:32:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2018-12-24 14:32:58,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:32:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:58,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:32:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:32:58,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:32:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:33:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:01,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:01,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:33:01,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:33:01,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:33:01,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:01,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:33:01,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:33:01,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:33:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:33:01,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:33:01,677 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 [2018-12-24 14:33:01,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:33:01,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:33:01,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:33:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:04,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:33:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:08,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:33:08,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2018-12-24 14:33:08,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:33:08,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-24 14:33:08,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-24 14:33:08,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 14:33:08,925 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2018-12-24 14:33:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:33:09,499 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-12-24 14:33:09,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 14:33:09,500 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2018-12-24 14:33:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:33:09,501 INFO L225 Difference]: With dead ends: 237 [2018-12-24 14:33:09,501 INFO L226 Difference]: Without dead ends: 236 [2018-12-24 14:33:09,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 306 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 14:33:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-24 14:33:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2018-12-24 14:33:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-24 14:33:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-12-24 14:33:09,508 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2018-12-24 14:33:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:33:09,508 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-12-24 14:33:09,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-24 14:33:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-12-24 14:33:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-24 14:33:09,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:33:09,509 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2018-12-24 14:33:09,509 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:33:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:33:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2018-12-24 14:33:09,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:33:09,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:09,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:33:09,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:09,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:33:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:33:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:12,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:12,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:33:12,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:33:12,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:33:12,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:12,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:33:12,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:33:12,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:33:12,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-24 14:33:12,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:33:12,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:33:12,747 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 [2018-12-24 14:33:12,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:33:12,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:33:12,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:33:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:16,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:33:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:20,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:33:20,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2018-12-24 14:33:20,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:33:20,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-24 14:33:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-24 14:33:20,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:33:20,015 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2018-12-24 14:33:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:33:20,632 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-12-24 14:33:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 14:33:20,633 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2018-12-24 14:33:20,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:33:20,634 INFO L225 Difference]: With dead ends: 240 [2018-12-24 14:33:20,634 INFO L226 Difference]: Without dead ends: 239 [2018-12-24 14:33:20,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 310 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 14:33:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-24 14:33:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2018-12-24 14:33:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-12-24 14:33:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-12-24 14:33:20,640 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2018-12-24 14:33:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:33:20,640 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-12-24 14:33:20,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-24 14:33:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-12-24 14:33:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-24 14:33:20,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:33:20,641 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2018-12-24 14:33:20,641 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:33:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:33:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2018-12-24 14:33:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:33:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:20,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:33:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:20,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:33:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:33:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:23,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:23,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:33:23,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:33:23,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:33:23,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:23,455 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:33:23,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:33:23,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:33:23,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:33:23,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:33:23,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:33:23,555 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 [2018-12-24 14:33:23,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:33:23,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:33:23,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:33:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:26,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:33:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:30,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:33:30,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2018-12-24 14:33:30,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:33:30,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-24 14:33:30,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-24 14:33:30,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 14:33:30,874 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2018-12-24 14:33:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:33:31,435 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-12-24 14:33:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 14:33:31,436 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2018-12-24 14:33:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:33:31,437 INFO L225 Difference]: With dead ends: 243 [2018-12-24 14:33:31,437 INFO L226 Difference]: Without dead ends: 242 [2018-12-24 14:33:31,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 314 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 14:33:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-24 14:33:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-12-24 14:33:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-24 14:33:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-12-24 14:33:31,444 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2018-12-24 14:33:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:33:31,445 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-12-24 14:33:31,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-24 14:33:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-12-24 14:33:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-24 14:33:31,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:33:31,446 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2018-12-24 14:33:31,446 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:33:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:33:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2018-12-24 14:33:31,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:33:31,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:31,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:33:31,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:31,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:33:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:33:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:34,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:34,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:33:34,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:33:34,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:33:34,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:34,605 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:33:34,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:33:34,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:33:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:33:34,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:33:34,686 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 [2018-12-24 14:33:34,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:33:34,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:33:34,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:33:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:38,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:33:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:42,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:33:42,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2018-12-24 14:33:42,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:33:42,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-24 14:33:42,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-24 14:33:42,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:33:42,074 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2018-12-24 14:33:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:33:42,639 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-12-24 14:33:42,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 14:33:42,640 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2018-12-24 14:33:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:33:42,641 INFO L225 Difference]: With dead ends: 246 [2018-12-24 14:33:42,641 INFO L226 Difference]: Without dead ends: 245 [2018-12-24 14:33:42,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 318 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 14:33:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-24 14:33:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2018-12-24 14:33:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-24 14:33:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-12-24 14:33:42,646 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2018-12-24 14:33:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:33:42,646 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-12-24 14:33:42,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-24 14:33:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-12-24 14:33:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-24 14:33:42,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:33:42,648 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2018-12-24 14:33:42,648 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:33:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:33:42,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2018-12-24 14:33:42,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:33:42,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:42,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:33:42,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:42,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:33:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:33:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:45,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:45,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:33:45,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:33:45,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:33:45,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:45,616 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:33:45,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:33:45,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:33:46,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-24 14:33:46,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:33:46,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:33:46,033 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 [2018-12-24 14:33:46,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:33:46,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:33:46,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:33:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:49,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:33:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:53,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:33:53,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2018-12-24 14:33:53,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:33:53,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-24 14:33:53,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-24 14:33:53,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 14:33:53,556 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2018-12-24 14:33:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:33:54,097 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-12-24 14:33:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 14:33:54,097 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2018-12-24 14:33:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:33:54,098 INFO L225 Difference]: With dead ends: 249 [2018-12-24 14:33:54,098 INFO L226 Difference]: Without dead ends: 248 [2018-12-24 14:33:54,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 322 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 14:33:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-24 14:33:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2018-12-24 14:33:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-24 14:33:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-12-24 14:33:54,103 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2018-12-24 14:33:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:33:54,103 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-12-24 14:33:54,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-24 14:33:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-12-24 14:33:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-24 14:33:54,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:33:54,105 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2018-12-24 14:33:54,105 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:33:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:33:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2018-12-24 14:33:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:33:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:54,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:33:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:33:54,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:33:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:33:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:33:57,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:57,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:33:57,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:33:57,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:33:57,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:33:57,108 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:33:57,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:33:57,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:33:57,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:33:57,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:33:57,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:33:57,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 [2018-12-24 14:33:57,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:33:57,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:33:57,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:34:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:00,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:34:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:04,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:34:04,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2018-12-24 14:34:04,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:34:04,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-24 14:34:04,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-24 14:34:04,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:34:04,819 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2018-12-24 14:34:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:34:05,419 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-12-24 14:34:05,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 14:34:05,419 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2018-12-24 14:34:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:34:05,421 INFO L225 Difference]: With dead ends: 252 [2018-12-24 14:34:05,421 INFO L226 Difference]: Without dead ends: 251 [2018-12-24 14:34:05,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 326 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 14:34:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-24 14:34:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2018-12-24 14:34:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-12-24 14:34:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-12-24 14:34:05,426 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2018-12-24 14:34:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:34:05,426 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-12-24 14:34:05,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-24 14:34:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-12-24 14:34:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-24 14:34:05,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:34:05,427 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2018-12-24 14:34:05,427 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:34:05,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:34:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2018-12-24 14:34:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:34:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:05,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:34:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:05,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:34:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:34:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:08,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:08,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:34:08,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:34:08,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:34:08,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:08,503 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:34:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:34:08,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:34:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:34:08,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:34:08,591 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 [2018-12-24 14:34:08,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:34:08,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:34:08,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:34:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:12,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:34:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:16,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:34:16,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2018-12-24 14:34:16,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:34:16,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-24 14:34:16,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-24 14:34:16,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 14:34:16,292 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2018-12-24 14:34:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:34:16,846 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-12-24 14:34:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 14:34:16,847 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2018-12-24 14:34:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:34:16,848 INFO L225 Difference]: With dead ends: 255 [2018-12-24 14:34:16,849 INFO L226 Difference]: Without dead ends: 254 [2018-12-24 14:34:16,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 330 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 14:34:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-24 14:34:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-12-24 14:34:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-24 14:34:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-12-24 14:34:16,854 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2018-12-24 14:34:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:34:16,854 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-12-24 14:34:16,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-24 14:34:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-12-24 14:34:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-24 14:34:16,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:34:16,856 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2018-12-24 14:34:16,856 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:34:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:34:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2018-12-24 14:34:16,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:34:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:16,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:34:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:16,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:34:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:34:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:20,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:20,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:34:20,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:34:20,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:34:20,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:20,010 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:34:20,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:34:20,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:34:20,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-24 14:34:20,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:34:20,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:34:20,462 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 [2018-12-24 14:34:20,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:34:20,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:34:20,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:34:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:24,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:34:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:28,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:34:28,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2018-12-24 14:34:28,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:34:28,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-24 14:34:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-24 14:34:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:34:28,290 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2018-12-24 14:34:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:34:28,858 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-12-24 14:34:28,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 14:34:28,858 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2018-12-24 14:34:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:34:28,860 INFO L225 Difference]: With dead ends: 258 [2018-12-24 14:34:28,860 INFO L226 Difference]: Without dead ends: 257 [2018-12-24 14:34:28,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 334 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 14:34:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-24 14:34:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2018-12-24 14:34:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-24 14:34:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-12-24 14:34:28,866 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2018-12-24 14:34:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:34:28,866 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-12-24 14:34:28,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-24 14:34:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-12-24 14:34:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-24 14:34:28,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:34:28,867 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2018-12-24 14:34:28,868 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:34:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:34:28,868 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2018-12-24 14:34:28,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:34:28,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:28,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:34:28,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:28,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:34:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:34:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:32,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:32,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:34:32,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:34:32,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:34:32,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:32,118 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:34:32,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:34:32,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:34:32,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:34:32,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:34:32,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:34:32,227 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 [2018-12-24 14:34:32,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:34:32,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:34:32,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:34:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:36,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:34:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:40,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:34:40,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2018-12-24 14:34:40,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:34:40,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-24 14:34:40,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-24 14:34:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2018-12-24 14:34:40,175 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2018-12-24 14:34:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:34:40,828 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-12-24 14:34:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 14:34:40,828 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2018-12-24 14:34:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:34:40,830 INFO L225 Difference]: With dead ends: 261 [2018-12-24 14:34:40,830 INFO L226 Difference]: Without dead ends: 260 [2018-12-24 14:34:40,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2018-12-24 14:34:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-24 14:34:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2018-12-24 14:34:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-24 14:34:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-12-24 14:34:40,837 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2018-12-24 14:34:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:34:40,837 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-12-24 14:34:40,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-24 14:34:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-12-24 14:34:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-24 14:34:40,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:34:40,838 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2018-12-24 14:34:40,838 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:34:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:34:40,839 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2018-12-24 14:34:40,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:34:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:40,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:34:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:40,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:34:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:34:44,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:44,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:44,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:34:44,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:34:44,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:34:44,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:44,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:34:44,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:34:44,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:34:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:34:44,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:34:44,566 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 [2018-12-24 14:34:44,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:34:44,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:34:44,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:34:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:48,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:34:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:52,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:34:52,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2018-12-24 14:34:52,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:34:52,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-24 14:34:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-24 14:34:52,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 14:34:52,602 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2018-12-24 14:34:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:34:53,261 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-12-24 14:34:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-24 14:34:53,262 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2018-12-24 14:34:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:34:53,263 INFO L225 Difference]: With dead ends: 264 [2018-12-24 14:34:53,263 INFO L226 Difference]: Without dead ends: 263 [2018-12-24 14:34:53,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 342 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 14:34:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-24 14:34:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2018-12-24 14:34:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-24 14:34:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-12-24 14:34:53,271 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2018-12-24 14:34:53,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:34:53,271 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-12-24 14:34:53,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-24 14:34:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-12-24 14:34:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-24 14:34:53,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:34:53,273 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2018-12-24 14:34:53,273 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:34:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:34:53,273 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2018-12-24 14:34:53,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:34:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:53,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:34:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:34:53,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:34:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:34:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:34:56,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:56,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:34:56,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:34:56,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:34:56,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:34:56,646 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:34:56,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:34:56,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:34:57,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-24 14:34:57,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:34:57,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:34:57,128 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 [2018-12-24 14:34:57,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:34:57,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:34:57,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:35:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:01,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:35:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:05,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:35:05,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2018-12-24 14:35:05,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:35:05,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-24 14:35:05,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-24 14:35:05,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2018-12-24 14:35:05,285 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2018-12-24 14:35:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:35:05,930 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-12-24 14:35:05,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 14:35:05,930 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2018-12-24 14:35:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:35:05,931 INFO L225 Difference]: With dead ends: 267 [2018-12-24 14:35:05,931 INFO L226 Difference]: Without dead ends: 266 [2018-12-24 14:35:05,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 346 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2018-12-24 14:35:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-24 14:35:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-12-24 14:35:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-24 14:35:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-12-24 14:35:05,937 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2018-12-24 14:35:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:35:05,937 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-12-24 14:35:05,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-24 14:35:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-12-24 14:35:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-24 14:35:05,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:35:05,938 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2018-12-24 14:35:05,938 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:35:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:35:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2018-12-24 14:35:05,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:35:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:05,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:35:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:05,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:35:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:35:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:09,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:35:09,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:35:09,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:35:09,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:35:09,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:35:09,413 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:35:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:35:09,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:35:09,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:35:09,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:35:09,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:35:09,524 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 [2018-12-24 14:35:09,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:35:09,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:35:09,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:35:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:13,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:35:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:17,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:35:17,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2018-12-24 14:35:17,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:35:17,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-24 14:35:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-24 14:35:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:35:17,717 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2018-12-24 14:35:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:35:18,310 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-12-24 14:35:18,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-24 14:35:18,311 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2018-12-24 14:35:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:35:18,312 INFO L225 Difference]: With dead ends: 270 [2018-12-24 14:35:18,313 INFO L226 Difference]: Without dead ends: 269 [2018-12-24 14:35:18,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 350 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 14:35:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-24 14:35:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2018-12-24 14:35:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-24 14:35:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-12-24 14:35:18,319 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2018-12-24 14:35:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:35:18,319 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-12-24 14:35:18,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-24 14:35:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-12-24 14:35:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-12-24 14:35:18,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:35:18,320 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2018-12-24 14:35:18,320 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:35:18,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:35:18,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2018-12-24 14:35:18,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:35:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:18,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:35:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:18,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:35:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:35:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:21,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:35:21,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:35:21,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:35:21,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:35:21,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:35:21,857 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:35:21,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:35:21,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:35:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:35:21,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:35:21,953 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 [2018-12-24 14:35:21,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:35:21,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:35:21,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:35:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:26,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:35:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:30,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:35:30,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2018-12-24 14:35:30,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:35:30,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-24 14:35:30,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-24 14:35:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 14:35:30,270 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2018-12-24 14:35:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:35:31,021 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-12-24 14:35:31,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 14:35:31,021 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2018-12-24 14:35:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:35:31,022 INFO L225 Difference]: With dead ends: 273 [2018-12-24 14:35:31,023 INFO L226 Difference]: Without dead ends: 272 [2018-12-24 14:35:31,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 354 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 14:35:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-24 14:35:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2018-12-24 14:35:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-24 14:35:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-12-24 14:35:31,028 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2018-12-24 14:35:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:35:31,028 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-12-24 14:35:31,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-24 14:35:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-12-24 14:35:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-24 14:35:31,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:35:31,029 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2018-12-24 14:35:31,029 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:35:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:35:31,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2018-12-24 14:35:31,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:35:31,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:31,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:35:31,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:31,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:35:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:35:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:34,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:35:34,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:35:34,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:35:34,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:35:34,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:35:34,638 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:35:34,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:35:34,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:35:35,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-24 14:35:35,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:35:35,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:35:35,165 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 [2018-12-24 14:35:35,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:35:35,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:35:35,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:35:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:39,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:35:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:43,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:35:43,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2018-12-24 14:35:43,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:35:43,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-24 14:35:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-24 14:35:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 14:35:43,561 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2018-12-24 14:35:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:35:44,270 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-12-24 14:35:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 14:35:44,271 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2018-12-24 14:35:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:35:44,273 INFO L225 Difference]: With dead ends: 276 [2018-12-24 14:35:44,273 INFO L226 Difference]: Without dead ends: 275 [2018-12-24 14:35:44,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 358 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 14:35:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-24 14:35:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2018-12-24 14:35:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-12-24 14:35:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-12-24 14:35:44,279 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2018-12-24 14:35:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:35:44,279 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-12-24 14:35:44,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-24 14:35:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-12-24 14:35:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-24 14:35:44,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:35:44,280 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2018-12-24 14:35:44,280 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:35:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:35:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2018-12-24 14:35:44,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:35:44,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:44,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:35:44,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:44,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:35:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:35:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:47,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:35:47,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:35:47,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:35:47,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:35:47,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:35:47,989 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:35:47,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:35:47,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:35:48,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:35:48,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:35:48,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:35:48,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 [2018-12-24 14:35:48,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:35:48,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:35:48,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:35:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:52,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:35:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:35:56,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:35:56,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2018-12-24 14:35:56,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:35:56,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-24 14:35:56,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-24 14:35:56,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2018-12-24 14:35:56,663 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2018-12-24 14:35:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:35:57,363 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-12-24 14:35:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 14:35:57,363 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2018-12-24 14:35:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:35:57,365 INFO L225 Difference]: With dead ends: 279 [2018-12-24 14:35:57,365 INFO L226 Difference]: Without dead ends: 278 [2018-12-24 14:35:57,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 362 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2018-12-24 14:35:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-24 14:35:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-12-24 14:35:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-24 14:35:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-12-24 14:35:57,371 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2018-12-24 14:35:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:35:57,371 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-12-24 14:35:57,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-24 14:35:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-12-24 14:35:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-24 14:35:57,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:35:57,372 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2018-12-24 14:35:57,372 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:35:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:35:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2018-12-24 14:35:57,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:35:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:57,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:35:57,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:35:57,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:35:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:36:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:01,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:01,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:36:01,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:36:01,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:36:01,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:01,130 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:36:01,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:36:01,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:36:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:36:01,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:36:01,228 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 [2018-12-24 14:36:01,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:36:01,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:36:01,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:36:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:05,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:36:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:09,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:36:09,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2018-12-24 14:36:09,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:36:09,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-24 14:36:09,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-24 14:36:09,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:36:09,848 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2018-12-24 14:36:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:36:10,504 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-12-24 14:36:10,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-24 14:36:10,504 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2018-12-24 14:36:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:36:10,506 INFO L225 Difference]: With dead ends: 282 [2018-12-24 14:36:10,506 INFO L226 Difference]: Without dead ends: 281 [2018-12-24 14:36:10,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 366 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 14:36:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-24 14:36:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2018-12-24 14:36:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-24 14:36:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-12-24 14:36:10,513 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2018-12-24 14:36:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:36:10,513 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-12-24 14:36:10,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-24 14:36:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-12-24 14:36:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-24 14:36:10,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:36:10,514 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2018-12-24 14:36:10,514 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:36:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:36:10,515 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2018-12-24 14:36:10,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:36:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:36:10,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:36:10,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:36:10,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:36:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:36:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:14,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:14,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:36:14,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:36:14,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:36:14,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:14,650 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:36:14,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:36:14,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:36:15,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-24 14:36:15,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:36:15,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:36:15,221 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 [2018-12-24 14:36:15,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:36:15,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:36:15,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:36:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:19,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:36:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:23,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:36:23,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2018-12-24 14:36:23,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:36:23,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-24 14:36:23,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-24 14:36:23,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2018-12-24 14:36:23,974 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2018-12-24 14:36:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:36:24,730 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-12-24 14:36:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 14:36:24,730 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2018-12-24 14:36:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:36:24,732 INFO L225 Difference]: With dead ends: 285 [2018-12-24 14:36:24,732 INFO L226 Difference]: Without dead ends: 284 [2018-12-24 14:36:24,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 370 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2018-12-24 14:36:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-24 14:36:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2018-12-24 14:36:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-24 14:36:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-12-24 14:36:24,737 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2018-12-24 14:36:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:36:24,738 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-12-24 14:36:24,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-24 14:36:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-12-24 14:36:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-24 14:36:24,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:36:24,739 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2018-12-24 14:36:24,739 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:36:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:36:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2018-12-24 14:36:24,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:36:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:36:24,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:36:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:36:24,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:36:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:36:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:28,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:28,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:36:28,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:36:28,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:36:28,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:28,650 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:36:28,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:36:28,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:36:28,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:36:28,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:36:28,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:36:28,782 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 [2018-12-24 14:36:28,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:36:28,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:36:28,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:36:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:33,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:36:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:37,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:36:37,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2018-12-24 14:36:37,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:36:37,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-24 14:36:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-24 14:36:37,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 14:36:37,564 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 190 states. [2018-12-24 14:36:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:36:38,316 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-12-24 14:36:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-24 14:36:38,316 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 282 [2018-12-24 14:36:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:36:38,318 INFO L225 Difference]: With dead ends: 288 [2018-12-24 14:36:38,318 INFO L226 Difference]: Without dead ends: 287 [2018-12-24 14:36:38,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 374 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 14:36:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-24 14:36:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2018-12-24 14:36:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-24 14:36:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-12-24 14:36:38,324 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2018-12-24 14:36:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:36:38,324 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-12-24 14:36:38,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-24 14:36:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-12-24 14:36:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-24 14:36:38,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:36:38,326 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1] [2018-12-24 14:36:38,326 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:36:38,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:36:38,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2108537696, now seen corresponding path program 94 times [2018-12-24 14:36:38,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:36:38,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:36:38,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:36:38,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:36:38,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:36:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:36:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:42,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:42,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:36:42,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:36:42,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:36:42,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:42,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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:36:42,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:36:42,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:36:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:36:42,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:36:42,422 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 [2018-12-24 14:36:42,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:36:42,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:36:42,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:36:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:47,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:36:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:51,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:36:51,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2018-12-24 14:36:51,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:36:51,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-24 14:36:51,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-24 14:36:51,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2018-12-24 14:36:51,336 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 192 states. [2018-12-24 14:36:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:36:51,990 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-12-24 14:36:51,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 14:36:51,991 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 285 [2018-12-24 14:36:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:36:51,992 INFO L225 Difference]: With dead ends: 291 [2018-12-24 14:36:51,992 INFO L226 Difference]: Without dead ends: 290 [2018-12-24 14:36:51,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 378 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2018-12-24 14:36:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-24 14:36:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-12-24 14:36:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-24 14:36:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-12-24 14:36:51,999 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2018-12-24 14:36:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:36:51,999 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-12-24 14:36:51,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-24 14:36:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-12-24 14:36:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-24 14:36:52,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:36:52,001 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1] [2018-12-24 14:36:52,001 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:36:52,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:36:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1549756020, now seen corresponding path program 95 times [2018-12-24 14:36:52,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:36:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:36:52,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:36:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:36:52,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:36:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:36:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:36:56,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:56,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:36:56,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:36:56,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:36:56,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:36:56,108 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:36:56,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:36:56,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:36:56,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-24 14:36:56,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:36:56,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:36:56,712 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 [2018-12-24 14:36:56,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:36:56,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:36:56,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:37:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:01,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:37:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:05,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:37:05,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2018-12-24 14:37:05,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:37:05,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-24 14:37:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-24 14:37:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:37:05,799 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 194 states. [2018-12-24 14:37:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:37:06,556 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-12-24 14:37:06,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 14:37:06,557 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 288 [2018-12-24 14:37:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:37:06,559 INFO L225 Difference]: With dead ends: 294 [2018-12-24 14:37:06,559 INFO L226 Difference]: Without dead ends: 293 [2018-12-24 14:37:06,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 382 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 14:37:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-24 14:37:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2018-12-24 14:37:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-24 14:37:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-12-24 14:37:06,565 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2018-12-24 14:37:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:37:06,566 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-12-24 14:37:06,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-24 14:37:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-12-24 14:37:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-24 14:37:06,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:37:06,567 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1] [2018-12-24 14:37:06,567 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:37:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:37:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881696, now seen corresponding path program 96 times [2018-12-24 14:37:06,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:37:06,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:37:06,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:37:06,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:37:06,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:37:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:37:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:10,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:37:10,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:37:10,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:37:10,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:37:10,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:37:10,692 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:37:10,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:37:10,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:37:10,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:37:10,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:37:10,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:37:10,816 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 [2018-12-24 14:37:10,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:37:10,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:37:10,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:37:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:15,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:37:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:19,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:37:19,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2018-12-24 14:37:19,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:37:19,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-12-24 14:37:19,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-12-24 14:37:19,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2018-12-24 14:37:19,968 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 196 states. [2018-12-24 14:37:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:37:20,604 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-12-24 14:37:20,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 14:37:20,604 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 291 [2018-12-24 14:37:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:37:20,606 INFO L225 Difference]: With dead ends: 297 [2018-12-24 14:37:20,606 INFO L226 Difference]: Without dead ends: 296 [2018-12-24 14:37:20,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 386 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2018-12-24 14:37:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-24 14:37:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2018-12-24 14:37:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-12-24 14:37:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-12-24 14:37:20,613 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2018-12-24 14:37:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:37:20,613 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-12-24 14:37:20,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-12-24 14:37:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-12-24 14:37:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-24 14:37:20,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:37:20,614 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1] [2018-12-24 14:37:20,614 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:37:20,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:37:20,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1017839884, now seen corresponding path program 97 times [2018-12-24 14:37:20,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:37:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:37:20,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:37:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:37:20,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:37:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:37:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:24,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:37:24,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:37:24,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:37:24,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:37:24,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:37:24,891 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:37:24,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:37:24,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:37:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:37:24,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:37:24,992 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 [2018-12-24 14:37:24,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:37:25,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:37:25,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:37:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:30,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:37:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:34,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:37:34,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2018-12-24 14:37:34,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:37:34,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-24 14:37:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-24 14:37:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 14:37:34,290 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 198 states. [2018-12-24 14:37:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:37:35,038 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-12-24 14:37:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-24 14:37:35,038 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 294 [2018-12-24 14:37:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:37:35,040 INFO L225 Difference]: With dead ends: 300 [2018-12-24 14:37:35,040 INFO L226 Difference]: Without dead ends: 299 [2018-12-24 14:37:35,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 390 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 14:37:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-24 14:37:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2018-12-24 14:37:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-24 14:37:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-12-24 14:37:35,047 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2018-12-24 14:37:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:37:35,047 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-12-24 14:37:35,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-24 14:37:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-12-24 14:37:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-12-24 14:37:35,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:37:35,048 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1] [2018-12-24 14:37:35,049 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:37:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:37:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1084000, now seen corresponding path program 98 times [2018-12-24 14:37:35,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:37:35,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:37:35,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:37:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:37:35,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:37:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:37:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:39,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:37:39,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:37:39,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:37:39,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:37:39,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:37:39,370 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:37:39,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:37:39,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:37:39,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-24 14:37:39,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:37:40,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:37:40,008 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 [2018-12-24 14:37:40,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:37:40,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:37:40,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:37:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:45,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:37:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:49,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:37:49,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2018-12-24 14:37:49,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:37:49,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-12-24 14:37:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-12-24 14:37:49,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 14:37:49,370 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 200 states. [2018-12-24 14:37:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:37:50,202 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-12-24 14:37:50,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 14:37:50,202 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 297 [2018-12-24 14:37:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:37:50,203 INFO L225 Difference]: With dead ends: 303 [2018-12-24 14:37:50,203 INFO L226 Difference]: Without dead ends: 302 [2018-12-24 14:37:50,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 394 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 14:37:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-24 14:37:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-12-24 14:37:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-24 14:37:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-12-24 14:37:50,210 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2018-12-24 14:37:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:37:50,210 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-12-24 14:37:50,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-12-24 14:37:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-12-24 14:37:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-24 14:37:50,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:37:50,212 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1] [2018-12-24 14:37:50,212 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:37:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:37:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2066335884, now seen corresponding path program 99 times [2018-12-24 14:37:50,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:37:50,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:37:50,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:37:50,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:37:50,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:37:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:37:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:37:54,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:37:54,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:37:54,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:37:54,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:37:54,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:37:54,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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:37:54,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:37:54,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:37:54,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:37:54,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:37:54,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:37:54,758 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 [2018-12-24 14:37:54,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:37:54,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:37:54,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 14:38:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:38:00,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:38:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:38:04,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:38:04,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2018-12-24 14:38:04,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:38:04,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-12-24 14:38:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-12-24 14:38:04,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:38:04,136 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 202 states. [2018-12-24 14:38:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:38:04,860 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-12-24 14:38:04,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 14:38:04,861 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 300 [2018-12-24 14:38:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:38:04,862 INFO L225 Difference]: With dead ends: 306 [2018-12-24 14:38:04,863 INFO L226 Difference]: Without dead ends: 305 [2018-12-24 14:38:04,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 399 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 14:38:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-24 14:38:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2018-12-24 14:38:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-24 14:38:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-12-24 14:38:04,869 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2018-12-24 14:38:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:38:04,869 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-12-24 14:38:04,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-12-24 14:38:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-12-24 14:38:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-24 14:38:04,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:38:04,871 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1] [2018-12-24 14:38:04,871 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:38:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:38:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1553891808, now seen corresponding path program 100 times [2018-12-24 14:38:04,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:38:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:38:04,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:38:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:38:04,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:38:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:38:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 14752 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:38:09,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:38:09,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:38:09,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:38:09,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:38:09,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:38:09,097 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:38:09,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:38:09,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:38:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:38:09,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:38:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:38:09,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:38:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:38:13,246 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-24 14:38:13,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102, 102] imperfect sequences [102] total 103 [2018-12-24 14:38:13,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:38:13,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-24 14:38:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-24 14:38:13,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:38:13,248 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 103 states. [2018-12-24 14:38:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:38:13,958 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-12-24 14:38:13,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 14:38:13,958 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2018-12-24 14:38:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:38:13,959 INFO L225 Difference]: With dead ends: 306 [2018-12-24 14:38:13,959 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 14:38:13,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 504 SyntacticMatches, 100 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5544 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 14:38:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 14:38:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 14:38:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 14:38:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 14:38:13,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2018-12-24 14:38:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:38:13,962 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 14:38:13,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-24 14:38:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 14:38:13,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 14:38:13,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 14:38:14,121 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2018-12-24 14:38:17,096 WARN L181 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2018-12-24 14:38:17,102 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2018-12-24 14:38:17,103 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2018-12-24 14:38:17,103 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-12-24 14:38:17,103 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2018-12-24 14:38:17,103 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2018-12-24 14:38:17,106 INFO L444 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2018-12-24 14:38:17,107 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2018-12-24 14:38:17,151 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:38:17 BoogieIcfgContainer [2018-12-24 14:38:17,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 14:38:17,152 INFO L168 Benchmark]: Toolchain (without parser) took 725753.14 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 942.1 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -270.1 MB). Peak memory consumption was 672.0 MB. Max. memory is 7.1 GB. [2018-12-24 14:38:17,152 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:38:17,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:38:17,153 INFO L168 Benchmark]: Boogie Preprocessor took 27.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:38:17,153 INFO L168 Benchmark]: RCFGBuilder took 362.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 14:38:17,154 INFO L168 Benchmark]: TraceAbstraction took 725296.85 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 942.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -291.3 MB). Peak memory consumption was 650.9 MB. Max. memory is 7.1 GB. [2018-12-24 14:38:17,155 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 362.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 725296.85 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 942.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -291.3 MB). Peak memory consumption was 650.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 725.1s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 40.7s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 7321 SDslu, 1 SDs, 0 SdLazy, 27597 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35852 GetRequests, 20503 SyntacticMatches, 2649 SemanticMatches, 12700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303168 ImplicationChecksByTransitivity, 621.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 13.0s SatisfiabilityAnalysisTime, 646.5s InterpolantComputationTime, 30903 NumberOfCodeBlocks, 30903 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 46052 ConstructedInterpolants, 0 QuantifiedInterpolants, 70702786 SizeOfPredicates, 596 NumberOfNonLiveVariables, 32500 ConjunctsInSsa, 15942 ConjunctsInUnsatCore, 301 InterpolantComputations, 3 PerfectInterpolantSequences, 44852/1530150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...