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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/const1.i_3.bplTransformedIcfg_BEv2_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:12:16,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:12:16,427 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:12:16,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:12:16,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:12:16,446 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:12:16,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:12:16,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:12:16,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:12:16,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:12:16,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:12:16,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:12:16,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:12:16,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:12:16,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:12:16,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:12:16,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:12:16,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:12:16,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:12:16,463 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:12:16,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:12:16,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:12:16,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:12:16,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:12:16,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:12:16,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:12:16,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:12:16,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:12:16,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:12:16,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:12:16,474 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:12:16,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:12:16,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:12:16,475 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:12:16,476 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:12:16,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:12:16,477 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:12:16,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:12:16,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:12:16,493 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:12:16,494 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:12:16,494 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:12:16,494 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:12:16,494 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:12:16,495 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:12:16,495 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:12:16,495 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:12:16,495 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:12:16,495 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:12:16,495 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:12:16,496 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:12:16,496 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:12:16,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:12:16,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:12:16,497 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:12:16,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:12:16,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:12:16,498 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:12:16,498 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:12:16,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:12:16,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:12:16,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:12:16,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:12:16,499 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:12:16,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:12:16,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:12:16,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:12:16,499 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:12:16,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:12:16,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:12:16,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:12:16,500 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:12:16,500 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:12:16,501 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:12:16,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:12:16,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:12:16,501 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:12:16,501 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:12:16,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:12:16,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:12:16,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:12:16,555 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:12:16,556 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:12:16,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/const1.i_3.bplTransformedIcfg_BEv2_6.bpl [2018-12-03 16:12:16,557 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/const1.i_3.bplTransformedIcfg_BEv2_6.bpl' [2018-12-03 16:12:16,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:12:16,598 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:12:16,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:12:16,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:12:16,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:12:16,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:12:16,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:12:16,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:12:16,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:12:16,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... [2018-12-03 16:12:16,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:12:16,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:12:16,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:12:16,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:12:16,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:12:16,748 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 16:12:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:12:16,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:12:16,943 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:12:16,944 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:12:16,944 INFO L202 PluginConnector]: Adding new model const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:12:16 BoogieIcfgContainer [2018-12-03 16:12:16,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:12:16,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:12:16,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:12:16,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:12:16,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:12:16" (1/2) ... [2018-12-03 16:12:16,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3654a6 and model type const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:12:16, skipping insertion in model container [2018-12-03 16:12:16,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:12:16" (2/2) ... [2018-12-03 16:12:16,951 INFO L112 eAbstractionObserver]: Analyzing ICFG const1.i_3.bplTransformedIcfg_BEv2_6.bpl [2018-12-03 16:12:16,961 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:12:16,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:12:16,987 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:12:17,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:12:17,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:12:17,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:12:17,021 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:12:17,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:12:17,022 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:12:17,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:12:17,022 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:12:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:12:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:12:17,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:17,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:12:17,048 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:17,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:12:17,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:17,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:17,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:17,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:17,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:17,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:12:17,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:12:17,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:12:17,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:12:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:12:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:12:17,226 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:12:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:17,285 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:12:17,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:12:17,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:12:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:17,298 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:12:17,299 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:12:17,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:12:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:12:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:12:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:12:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:12:17,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:12:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:17,338 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:12:17,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:12:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:12:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:12:17,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:17,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:12:17,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:17,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:12:17,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:17,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:17,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:17,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:17,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:17,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:17,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:17,491 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:12:17,493 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:12:17,572 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:12:17,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:12:17,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:12:17,824 INFO L272 AbstractInterpreter]: Visited 4 different actions 9 times. Merged at 3 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:12:17,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:17,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:12:17,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:17,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:17,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:17,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:17,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:17,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:18,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:18,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:12:18,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:18,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:12:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:12:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:12:18,062 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 16:12:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:18,091 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:12:18,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:12:18,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:12:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:18,093 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:12:18,093 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:12:18,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:12:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:12:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:12:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:12:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:12:18,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:12:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:18,098 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:12:18,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:12:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:12:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:12:18,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:18,099 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:12:18,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:18,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:18,100 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:12:18,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:18,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:18,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:18,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:18,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:18,196 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:18,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:18,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:18,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:18,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:18,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:18,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:12:18,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:18,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:18,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:18,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:18,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:12:18,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:18,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:12:18,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:12:18,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:18,382 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 16:12:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:18,486 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:12:18,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:12:18,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:12:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:18,487 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:12:18,488 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:12:18,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:12:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:12:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:12:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:12:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:12:18,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:12:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:18,492 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:12:18,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:12:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:12:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:12:18,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:18,493 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:12:18,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:18,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:18,494 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 16:12:18,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:18,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:18,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:18,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:18,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:18,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:18,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:18,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:18,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:18,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:18,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:18,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:18,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:18,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:18,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:18,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:18,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:18,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:12:18,943 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:18,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:12:18,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:12:18,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:12:18,944 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 16:12:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:18,968 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:12:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:12:18,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:12:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:18,969 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:12:18,969 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:12:18,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:12:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:12:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:12:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:12:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:12:18,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:12:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:18,973 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:12:18,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:12:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:12:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:12:18,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:18,974 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:12:18,975 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:18,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:18,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 16:12:18,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:18,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:18,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:19,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:19,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:19,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:19,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:19,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:19,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:19,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:19,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:19,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:19,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:19,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:12:19,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:19,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:12:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:12:19,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:12:19,357 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 16:12:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:19,392 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:12:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:12:19,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:12:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:19,394 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:12:19,394 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:12:19,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:12:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:12:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:12:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:12:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:12:19,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:12:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:19,398 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:12:19,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:12:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:12:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:12:19,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:19,399 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:12:19,399 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:19,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 16:12:19,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:19,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:19,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:19,594 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-03 16:12:19,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:19,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:19,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:19,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:19,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:19,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:19,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:19,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:12:19,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:19,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:19,647 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-03 16:12:19,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:20,052 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-03 16:12:20,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:20,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:12:20,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:20,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:12:20,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:12:20,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:12:20,075 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 16:12:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:20,115 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:12:20,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:12:20,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:12:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:20,116 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:12:20,116 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:12:20,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:12:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:12:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:12:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:12:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:12:20,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:12:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:20,120 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:12:20,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:12:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:12:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:12:20,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:20,121 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:12:20,121 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:20,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 16:12:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:20,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:20,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:20,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:20,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:20,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:20,237 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:20,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:20,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:20,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:20,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:20,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:20,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:20,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:20,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:20,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:20,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:20,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:12:20,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:20,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:12:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:12:20,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:20,429 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 16:12:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:20,475 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:12:20,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:12:20,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:12:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:20,477 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:12:20,477 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:12:20,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:12:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:12:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:12:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:12:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 16:12:20,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 16:12:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:20,482 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 16:12:20,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:12:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 16:12:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:12:20,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:20,483 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:12:20,483 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:20,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:20,484 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 16:12:20,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:20,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:20,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:20,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:20,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:20,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:20,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:20,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:20,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:20,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:20,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:20,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:20,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:20,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:20,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:21,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:21,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:12:21,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:21,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:12:21,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:12:21,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:21,007 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 16:12:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:21,034 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 16:12:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:12:21,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:12:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:21,036 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:12:21,036 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:12:21,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:12:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:12:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:12:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:12:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:12:21,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 16:12:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:21,040 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:12:21,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:12:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:12:21,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:12:21,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:21,041 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:12:21,041 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:21,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:21,042 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 16:12:21,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:21,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:21,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:21,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:21,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:21,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:21,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:21,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:21,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:21,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:12:21,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:21,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:21,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:21,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:21,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:12:21,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:21,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:12:21,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:12:21,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:12:21,484 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 16:12:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:21,510 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:12:21,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:12:21,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:12:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:21,511 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:12:21,511 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:12:21,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:12:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:12:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:12:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:12:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 16:12:21,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 16:12:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:21,515 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 16:12:21,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:12:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 16:12:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:12:21,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:21,516 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 16:12:21,516 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:21,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:21,516 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 16:12:21,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:21,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:21,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:21,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:21,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:21,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:21,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:21,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:21,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:21,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:21,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:21,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:21,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:21,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:21,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:21,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:21,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:12:21,943 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:21,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:12:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:12:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:12:21,945 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 16:12:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:21,981 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 16:12:21,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:12:21,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:12:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:21,982 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:12:21,982 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:12:21,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:12:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:12:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:12:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:12:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:12:21,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 16:12:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:21,987 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:12:21,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:12:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:12:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:12:21,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:21,988 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 16:12:21,988 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:21,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 16:12:21,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:21,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:21,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:22,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:22,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:22,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:22,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:22,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:22,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:22,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:22,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:22,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:22,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:22,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:22,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:12:22,495 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:22,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:12:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:12:22,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:12:22,496 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 16:12:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:22,531 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:12:22,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:12:22,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 16:12:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:22,532 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:12:22,532 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:12:22,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:12:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:12:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:12:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:12:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 16:12:22,536 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 16:12:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:22,537 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 16:12:22,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:12:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 16:12:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:12:22,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:22,537 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 16:12:22,538 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:22,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 16:12:22,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:22,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:22,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:22,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:22,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:23,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:23,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:23,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:23,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:23,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:23,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:23,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:23,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:23,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:12:23,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:23,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:23,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:23,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:23,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:12:23,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:23,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:12:23,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:12:23,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:12:23,390 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 16:12:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:23,421 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 16:12:23,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:12:23,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 16:12:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:23,422 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:12:23,422 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:12:23,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:12:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:12:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:12:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:12:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:12:23,426 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 16:12:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:23,427 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:12:23,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:12:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:12:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:12:23,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:23,427 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 16:12:23,428 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:23,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 16:12:23,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:23,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:23,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:23,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:23,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:23,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:23,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:23,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:23,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:23,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:23,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:23,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:23,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:23,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:23,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:23,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:23,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:24,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:24,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:12:24,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:24,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:12:24,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:12:24,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:12:24,022 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 16:12:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:24,053 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:12:24,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:12:24,059 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 16:12:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:24,059 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:12:24,060 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:12:24,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:12:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:12:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:12:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:12:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 16:12:24,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 16:12:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:24,069 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 16:12:24,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:12:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 16:12:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:12:24,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:24,070 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 16:12:24,070 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:24,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 16:12:24,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:24,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:24,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:24,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:24,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:24,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:24,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:24,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:24,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:24,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:24,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:24,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:24,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:24,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:24,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:12:24,847 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:24,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:12:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:12:24,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:12:24,849 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 16:12:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:24,876 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 16:12:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:12:24,880 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 16:12:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:24,880 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:12:24,880 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:12:24,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:12:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:12:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:12:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:12:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:12:24,884 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 16:12:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:24,884 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:12:24,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:12:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:12:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:12:24,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:24,884 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 16:12:24,885 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:24,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:24,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 16:12:24,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:24,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:24,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:24,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:24,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:25,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:25,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:25,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:25,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:25,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:25,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:25,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:25,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:25,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:12:25,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:25,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:25,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:26,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:26,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:12:26,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:26,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:12:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:12:26,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:12:26,344 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 16:12:26,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:26,372 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:12:26,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:12:26,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 16:12:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:26,374 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:12:26,374 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:12:26,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:12:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:12:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:12:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:12:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 16:12:26,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 16:12:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:26,378 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 16:12:26,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:12:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 16:12:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:12:26,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:26,379 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 16:12:26,380 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:26,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:26,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 16:12:26,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:26,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:26,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:26,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:26,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:26,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:26,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:26,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:26,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:26,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:26,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:26,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:26,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:26,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:26,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:26,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:26,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:27,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:27,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:12:27,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:27,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:12:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:12:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:12:27,278 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 16:12:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:27,309 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 16:12:27,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:12:27,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 16:12:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:27,310 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:12:27,310 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:12:27,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:12:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:12:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:12:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:12:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:12:27,315 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 16:12:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:27,316 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:12:27,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:12:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:12:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:12:27,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:27,316 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 16:12:27,317 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:27,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 16:12:27,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:27,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:27,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:27,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:28,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:28,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:28,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:28,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:28,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:28,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:28,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:28,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:28,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:28,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:28,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:12:28,996 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:28,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:12:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:12:28,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:12:28,997 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 16:12:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:29,023 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 16:12:29,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:12:29,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 16:12:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:29,025 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:12:29,025 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:12:29,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:12:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:12:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:12:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:12:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 16:12:29,029 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 16:12:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:29,029 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 16:12:29,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:12:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 16:12:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:12:29,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:29,030 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 16:12:29,030 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:29,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 16:12:29,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:29,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:29,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:29,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:29,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:29,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:29,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:29,281 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:29,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:29,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:29,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:29,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:29,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:29,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:12:29,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:29,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:29,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:30,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:30,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:12:30,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:30,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:12:30,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:12:30,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:12:30,206 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 16:12:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:30,239 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 16:12:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:12:30,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 16:12:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:30,241 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:12:30,241 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:12:30,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:12:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:12:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:12:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:12:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 16:12:30,246 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 16:12:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:30,247 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 16:12:30,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:12:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 16:12:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:12:30,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:30,247 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 16:12:30,248 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:30,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 16:12:30,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:30,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:30,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:30,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:30,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:30,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:30,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:30,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:30,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:30,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:30,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:30,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:30,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:31,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:31,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:31,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:12:31,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:31,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:12:31,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:12:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:12:31,456 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 16:12:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:31,491 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:12:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:12:31,492 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 16:12:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:31,492 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:12:31,492 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:12:31,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:12:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:12:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:12:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:12:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 16:12:31,496 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 16:12:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:31,497 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 16:12:31,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:12:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 16:12:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:12:31,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:31,498 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 16:12:31,498 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:31,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:31,498 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 16:12:31,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:31,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:31,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:31,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:31,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:31,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:31,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:31,817 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:31,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:31,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:31,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:31,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:31,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:31,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:31,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:32,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:32,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:12:32,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:32,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:12:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:12:32,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:12:32,362 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 16:12:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:32,412 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 16:12:32,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:12:32,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 16:12:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:32,416 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:12:32,416 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:12:32,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:12:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:12:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:12:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:12:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 16:12:32,420 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 16:12:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:32,420 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 16:12:32,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:12:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 16:12:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:12:32,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:32,421 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 16:12:32,421 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:32,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 16:12:32,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:32,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:32,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:32,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:32,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:32,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:32,712 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:32,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:32,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:32,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:32,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:32,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:32,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:12:32,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:32,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:32,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:33,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:33,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:12:33,465 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:33,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:12:33,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:12:33,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:12:33,467 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 16:12:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:33,508 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 16:12:33,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:12:33,509 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 16:12:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:33,510 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:12:33,510 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:12:33,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:12:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:12:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:12:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:12:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 16:12:33,514 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 16:12:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:33,515 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 16:12:33,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:12:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 16:12:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:12:33,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:33,516 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 16:12:33,516 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:33,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 16:12:33,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:33,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:33,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:33,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:33,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:33,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:33,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:33,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:33,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:33,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:33,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:33,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:33,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:33,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:33,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:33,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:34,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:12:34,611 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:34,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:12:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:12:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:12:34,613 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 16:12:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:34,711 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 16:12:34,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:12:34,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 16:12:34,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:34,715 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:12:34,715 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:12:34,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:12:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:12:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:12:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:12:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 16:12:34,719 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 16:12:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:34,719 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 16:12:34,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:12:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 16:12:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:12:34,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:34,720 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 16:12:34,720 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:34,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:34,721 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 16:12:34,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:34,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:34,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:34,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:34,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:34,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:34,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:34,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:34,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:34,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:35,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:35,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:35,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:35,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:35,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:35,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:35,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:12:35,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:35,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:12:35,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:12:35,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:12:35,658 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 16:12:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:35,736 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:12:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:12:35,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 16:12:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:35,738 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:12:35,738 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:12:35,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:12:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:12:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:12:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:12:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 16:12:35,742 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 16:12:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:35,742 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 16:12:35,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:12:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 16:12:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:12:35,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:35,744 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 16:12:35,744 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:35,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 16:12:35,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:35,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:35,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:36,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:36,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:36,275 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:36,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:36,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:36,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:36,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:36,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:36,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:12:36,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:36,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:36,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:37,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:37,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:12:37,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:37,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:12:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:12:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:12:37,072 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 16:12:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:37,112 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 16:12:37,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:12:37,113 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 16:12:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:37,113 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:12:37,114 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:12:37,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:12:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:12:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:12:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:12:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 16:12:37,119 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 16:12:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:37,119 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 16:12:37,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:12:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 16:12:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:12:37,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:37,120 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 16:12:37,120 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:37,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 16:12:37,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:37,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:37,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:37,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:37,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:37,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:37,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:37,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:37,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:37,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:37,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:37,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:37,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:37,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:37,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:37,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:37,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:38,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:38,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:12:38,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:38,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:12:38,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:12:38,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:12:38,578 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 16:12:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:38,647 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 16:12:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:12:38,647 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 16:12:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:38,648 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:12:38,648 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:12:38,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:12:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:12:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:12:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:12:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 16:12:38,654 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 16:12:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:38,654 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 16:12:38,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:12:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 16:12:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:12:38,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:38,656 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 16:12:38,656 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:38,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:38,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 16:12:38,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:38,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:38,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:38,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:38,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:39,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:39,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:39,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:39,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:39,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:39,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:39,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:39,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:39,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:39,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:40,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:12:40,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:40,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:12:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:12:40,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:12:40,863 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 16:12:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:40,921 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 16:12:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:12:40,922 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 16:12:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:40,923 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:12:40,923 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:12:40,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:12:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:12:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:12:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:12:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 16:12:40,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 16:12:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:40,927 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 16:12:40,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:12:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 16:12:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:12:40,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:40,928 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 16:12:40,928 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:40,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:40,928 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 16:12:40,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:40,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:40,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:40,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:40,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:41,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:41,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:41,873 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:41,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:41,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:41,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:41,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:41,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:41,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:12:41,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:41,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:41,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:42,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:42,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:12:42,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:42,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:12:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:12:42,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:12:42,742 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 16:12:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:42,895 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:12:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:12:42,895 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 16:12:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:42,896 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:12:42,896 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:12:42,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:12:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:12:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:12:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:12:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 16:12:42,900 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 16:12:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:42,901 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 16:12:42,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:12:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 16:12:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:12:42,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:42,902 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 16:12:42,902 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:42,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:42,902 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 16:12:42,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:42,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:42,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:42,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:42,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:43,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:43,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:43,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:43,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:43,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:43,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:43,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:43,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:43,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:43,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:43,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:43,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:44,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:44,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:12:44,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:44,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:12:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:12:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:12:44,459 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 16:12:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:44,491 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 16:12:44,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:12:44,492 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 16:12:44,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:44,492 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:12:44,492 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:12:44,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:12:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:12:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:12:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:12:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 16:12:44,497 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 16:12:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:44,497 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 16:12:44,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:12:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 16:12:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:12:44,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:44,498 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 16:12:44,499 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:44,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 16:12:44,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:44,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:44,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:44,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:44,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:44,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:44,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:44,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:44,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:44,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:44,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:44,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:44,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:45,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:45,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:12:45,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:45,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:12:45,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:12:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:12:45,863 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 16:12:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:45,942 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 16:12:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:12:45,942 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 16:12:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:45,943 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:12:45,943 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:12:45,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:12:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:12:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:12:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:12:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 16:12:45,948 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 16:12:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:45,948 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 16:12:45,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:12:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 16:12:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:12:45,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:45,949 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 16:12:45,949 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:45,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:45,949 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 16:12:45,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:45,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:45,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:45,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:45,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:46,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:46,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:46,732 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:46,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:46,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:46,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:46,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:46,741 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:46,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:12:46,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:46,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:46,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:47,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:47,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:12:47,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:47,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:12:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:12:47,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:12:47,909 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 16:12:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:47,970 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 16:12:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:12:47,971 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 16:12:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:47,971 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:12:47,972 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:12:47,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:12:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:12:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:12:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:12:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 16:12:47,976 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 16:12:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:47,976 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 16:12:47,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:12:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 16:12:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:12:47,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:47,977 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 16:12:47,977 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:47,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 16:12:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:47,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:47,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:48,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:48,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:48,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:48,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:48,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:48,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:48,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:48,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:48,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:48,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:48,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:48,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:49,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:49,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:12:49,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:49,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:12:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:12:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:12:49,815 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 16:12:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:49,909 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:12:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:12:49,910 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 16:12:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:49,910 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:12:49,911 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:12:49,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:12:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:12:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:12:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:12:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 16:12:49,913 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 16:12:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:49,913 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 16:12:49,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:12:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 16:12:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:12:49,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:49,914 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 16:12:49,914 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:49,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:49,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 16:12:49,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:49,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:49,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:49,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:50,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:50,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:50,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:50,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:50,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:50,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:50,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:50,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:50,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:50,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:51,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:51,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:12:51,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:51,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:12:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:12:51,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:12:51,773 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 16:12:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:51,835 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 16:12:51,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:12:51,835 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 16:12:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:51,836 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:12:51,836 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:12:51,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:12:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:12:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:12:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:12:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 16:12:51,840 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 16:12:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:51,840 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 16:12:51,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:12:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 16:12:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:12:51,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:51,841 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 16:12:51,841 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:51,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 16:12:51,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:51,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:51,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:52,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:52,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:52,412 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:52,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:52,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:52,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:52,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:52,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:52,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:12:52,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:52,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:52,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:53,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:53,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:12:53,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:53,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:12:53,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:12:53,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:12:53,766 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 16:12:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:53,831 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 16:12:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:12:53,832 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 16:12:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:53,832 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:12:53,832 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:12:53,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:12:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:12:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:12:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:12:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 16:12:53,836 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 16:12:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:53,837 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 16:12:53,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:12:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 16:12:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:12:53,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:53,837 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 16:12:53,837 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:53,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-03 16:12:53,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:53,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:53,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:55,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:55,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:55,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:55,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:55,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:55,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:55,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:12:55,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:12:55,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:12:55,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:55,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:55,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:56,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:56,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:12:56,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:56,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:12:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:12:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:12:56,344 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 16:12:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:56,503 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 16:12:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:12:56,504 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 16:12:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:56,504 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:12:56,504 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:12:56,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:12:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:12:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:12:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:12:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 16:12:56,507 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 16:12:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:56,507 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 16:12:56,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:12:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 16:12:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:12:56,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:56,508 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 16:12:56,508 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:56,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:56,508 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-03 16:12:56,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:56,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:56,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:12:56,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:56,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:57,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:57,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:57,306 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:57,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:57,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:57,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:57,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:57,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:12:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:57,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:57,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:12:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:58,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:12:58,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:12:58,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:12:58,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:12:58,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:12:58,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:12:58,635 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 16:12:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:12:58,700 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 16:12:58,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:12:58,701 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 16:12:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:12:58,701 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:12:58,702 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:12:58,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:12:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:12:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:12:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:12:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 16:12:58,705 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 16:12:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:12:58,705 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 16:12:58,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:12:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 16:12:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:12:58,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:12:58,706 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 16:12:58,706 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:12:58,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:12:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-03 16:12:58,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:12:58,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:58,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:12:58,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:12:58,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:12:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:12:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:59,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:59,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:12:59,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:12:59,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:12:59,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:12:59,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:12:59,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:12:59,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:12:59,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:12:59,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:12:59,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:12:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:12:59,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:00,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:00,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:13:00,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:00,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:13:00,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:13:00,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:13:00,959 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 16:13:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:01,006 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 16:13:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:13:01,007 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 16:13:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:01,007 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:13:01,007 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:13:01,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:13:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:13:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:13:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:13:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 16:13:01,010 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 16:13:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:01,011 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 16:13:01,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:13:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 16:13:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:13:01,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:01,011 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 16:13:01,011 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:01,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:01,012 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-03 16:13:01,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:01,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:01,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:02,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:02,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:02,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:02,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:02,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:02,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:02,294 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:13:02,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:13:02,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:13:02,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:02,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:02,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:03,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:03,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:13:03,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:03,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:13:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:13:03,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:13:03,888 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 16:13:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:03,940 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 16:13:03,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:13:03,941 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 16:13:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:03,942 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:13:03,942 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:13:03,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:13:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:13:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:13:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:13:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 16:13:03,944 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 16:13:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:03,944 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 16:13:03,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:13:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 16:13:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:13:03,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:03,945 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 16:13:03,945 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:03,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-03 16:13:03,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:03,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:03,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:04,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:04,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:04,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:04,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:04,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:04,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:04,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:04,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:04,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:04,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:06,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:06,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:13:06,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:06,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:13:06,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:13:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:13:06,373 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 16:13:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:06,435 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 16:13:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:13:06,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 16:13:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:06,436 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:13:06,437 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:13:06,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:13:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:13:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:13:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:13:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 16:13:06,439 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 16:13:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:06,439 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 16:13:06,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:13:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 16:13:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:13:06,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:06,440 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 16:13:06,440 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:06,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-03 16:13:06,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:06,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:06,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:06,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:06,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:07,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:07,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:07,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:07,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:07,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:07,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:07,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:07,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:07,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:13:07,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:07,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:07,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:09,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:09,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:13:09,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:09,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:13:09,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:13:09,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:13:09,027 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 16:13:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:09,079 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 16:13:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:13:09,079 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 16:13:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:09,080 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:13:09,080 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:13:09,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:13:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:13:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:13:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:13:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 16:13:09,084 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 16:13:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:09,084 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 16:13:09,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:13:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 16:13:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:13:09,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:09,084 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 16:13:09,084 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:09,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-03 16:13:09,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:09,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:09,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:09,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:09,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:10,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:10,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:10,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:10,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:10,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:10,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:10,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:13:10,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:13:10,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:13:10,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:10,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:10,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:12,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:12,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:13:12,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:12,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:13:12,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:13:12,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:13:12,148 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 16:13:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:12,211 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 16:13:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:13:12,211 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 16:13:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:12,212 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:13:12,212 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:13:12,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:13:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:13:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:13:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:13:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 16:13:12,215 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 16:13:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:12,215 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 16:13:12,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:13:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 16:13:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:13:12,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:12,216 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 16:13:12,217 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:12,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-03 16:13:12,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:12,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:12,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:12,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:12,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:12,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:12,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:12,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:12,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:12,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:12,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:12,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:12,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:12,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:12,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:14,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:14,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:13:14,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:14,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:13:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:13:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:13:14,793 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 16:13:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:14,888 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 16:13:14,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:13:14,890 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 16:13:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:14,891 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:13:14,891 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:13:14,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:13:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:13:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:13:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:13:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 16:13:14,893 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 16:13:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:14,893 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 16:13:14,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:13:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 16:13:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:13:14,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:14,894 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 16:13:14,894 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:14,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-03 16:13:14,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:14,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:14,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:14,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:14,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:15,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:15,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:15,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:15,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:15,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:15,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:15,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:15,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:15,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:13:15,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:15,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:15,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:18,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:18,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:13:18,033 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:18,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:13:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:13:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:13:18,034 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 16:13:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:18,102 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 16:13:18,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:13:18,103 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 16:13:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:18,104 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:13:18,104 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:13:18,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:13:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:13:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:13:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:13:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 16:13:18,106 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 16:13:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:18,106 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 16:13:18,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:13:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 16:13:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:13:18,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:18,107 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 16:13:18,107 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:18,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:18,108 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-03 16:13:18,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:18,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:18,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:18,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:18,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:19,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:19,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:19,113 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:19,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:19,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:19,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:19,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:13:19,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:13:19,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:13:19,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:19,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:19,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:21,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:21,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:13:21,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:21,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:13:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:13:21,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:13:21,286 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 16:13:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:21,336 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 16:13:21,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:13:21,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 16:13:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:21,338 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:13:21,338 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:13:21,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:13:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:13:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:13:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:13:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 16:13:21,341 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 16:13:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:21,342 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 16:13:21,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:13:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 16:13:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:13:21,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:21,342 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 16:13:21,343 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:21,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-03 16:13:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:21,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:21,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:22,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:22,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:22,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:22,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:22,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:22,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:22,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:22,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:22,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:22,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:24,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:24,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:13:24,696 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:24,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:13:24,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:13:24,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:13:24,697 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 16:13:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:24,842 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 16:13:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:13:24,843 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 16:13:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:24,843 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:13:24,843 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:13:24,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:13:24,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:13:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:13:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:13:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 16:13:24,847 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 16:13:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:24,847 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 16:13:24,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:13:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 16:13:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:13:24,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:24,848 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 16:13:24,848 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:24,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:24,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-03 16:13:24,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:24,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:24,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:24,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:26,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:26,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:26,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:26,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:26,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:26,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:26,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:26,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:26,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:13:26,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:26,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:26,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:29,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:29,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:13:29,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:29,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:13:29,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:13:29,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:13:29,153 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 16:13:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:29,209 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 16:13:29,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:13:29,209 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 16:13:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:29,210 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:13:29,210 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:13:29,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:13:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:13:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:13:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:13:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 16:13:29,214 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 16:13:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:29,214 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 16:13:29,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:13:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 16:13:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:13:29,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:29,215 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 16:13:29,215 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:29,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-03 16:13:29,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:29,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:29,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:30,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:30,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:30,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:30,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:30,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:30,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:30,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:13:30,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:13:30,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:13:30,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:30,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:30,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:32,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:32,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:13:32,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:32,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:13:32,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:13:32,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:13:32,702 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 16:13:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:33,040 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 16:13:33,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:13:33,041 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 16:13:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:33,042 INFO L225 Difference]: With dead ends: 52 [2018-12-03 16:13:33,042 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:13:33,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:13:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:13:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:13:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:13:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 16:13:33,044 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 16:13:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:33,044 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 16:13:33,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:13:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 16:13:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:13:33,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:33,046 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 16:13:33,046 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:33,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:33,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-03 16:13:33,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:33,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:33,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:33,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:33,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:33,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:33,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:33,963 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:33,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:33,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:33,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:33,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:33,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:34,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:34,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:36,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:36,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:13:36,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:36,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:13:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:13:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:13:36,359 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 16:13:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:36,449 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 16:13:36,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:13:36,450 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 16:13:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:36,450 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:13:36,451 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:13:36,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:13:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:13:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:13:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:13:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 16:13:36,454 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 16:13:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:36,454 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 16:13:36,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:13:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 16:13:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:13:36,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:36,455 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 16:13:36,455 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:36,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-03 16:13:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:36,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:36,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:38,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:38,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:38,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:38,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:38,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:38,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:38,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:38,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:38,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:13:38,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:38,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:38,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:40,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:40,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:13:40,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:40,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:13:40,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:13:40,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:13:40,471 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 16:13:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:40,530 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 16:13:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:13:40,531 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 16:13:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:40,532 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:13:40,532 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:13:40,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:13:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:13:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:13:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:13:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 16:13:40,536 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 16:13:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:40,536 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 16:13:40,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:13:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 16:13:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:13:40,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:40,537 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 16:13:40,537 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:40,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-03 16:13:40,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:40,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:40,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:40,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:40,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:41,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:41,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:41,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:41,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:41,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:41,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:41,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:13:41,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:13:41,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:13:41,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:41,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:41,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:44,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:44,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:13:44,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:44,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:13:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:13:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:13:44,310 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 16:13:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:44,452 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 16:13:44,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:13:44,452 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 16:13:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:44,453 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:13:44,453 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:13:44,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:13:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:13:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:13:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:13:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 16:13:44,456 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 16:13:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:44,456 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 16:13:44,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:13:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 16:13:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:13:44,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:44,457 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 16:13:44,457 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:44,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-03 16:13:44,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:44,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:44,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:45,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:45,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:45,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:45,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:45,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:45,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:45,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:45,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:45,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:45,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:48,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:48,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:13:48,735 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:48,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:13:48,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:13:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:13:48,737 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 16:13:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:48,795 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 16:13:48,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:13:48,795 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 16:13:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:48,796 INFO L225 Difference]: With dead ends: 56 [2018-12-03 16:13:48,796 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:13:48,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:13:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:13:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:13:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:13:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 16:13:48,800 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 16:13:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:48,800 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 16:13:48,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:13:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 16:13:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:13:48,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:48,800 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 16:13:48,801 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:48,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:48,801 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-03 16:13:48,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:48,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:48,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:48,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:50,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:50,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:50,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:50,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:50,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:50,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:13:50,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:13:50,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:13:50,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:50,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:50,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:53,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:53,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 16:13:53,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:53,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:13:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:13:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:13:53,164 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 16:13:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:53,319 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 16:13:53,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:13:53,319 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 16:13:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:53,320 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:13:53,320 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:13:53,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:13:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:13:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:13:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:13:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 16:13:53,324 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 16:13:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:53,324 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 16:13:53,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:13:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 16:13:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:13:53,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:53,325 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 16:13:53,325 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:53,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-03 16:13:53,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:53,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:53,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:53,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:53,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:54,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:54,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:54,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:54,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:54,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:54,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:54,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:13:54,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:13:54,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:13:54,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:13:54,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:54,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:13:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:57,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:13:57,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:13:57,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:13:57,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:13:57,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:13:57,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:13:57,291 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 16:13:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:13:57,381 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 16:13:57,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:13:57,381 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 16:13:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:13:57,382 INFO L225 Difference]: With dead ends: 58 [2018-12-03 16:13:57,382 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:13:57,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:13:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:13:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:13:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:13:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 16:13:57,384 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 16:13:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:13:57,384 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 16:13:57,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:13:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 16:13:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:13:57,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:13:57,385 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 16:13:57,385 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:13:57,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:13:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-03 16:13:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:13:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:57,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:13:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:13:57,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:13:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:58,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:58,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:13:58,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:13:58,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:13:58,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:13:58,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:13:58,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:13:58,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:13:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:13:58,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:13:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:13:58,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:01,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:01,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:14:01,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:01,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:14:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:14:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:14:01,836 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 16:14:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:02,005 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 16:14:02,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:14:02,006 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 16:14:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:02,006 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:14:02,006 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:14:02,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:14:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:14:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 16:14:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:14:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 16:14:02,010 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 16:14:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:02,010 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 16:14:02,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:14:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 16:14:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:14:02,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:02,011 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 16:14:02,011 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:02,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-03 16:14:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:02,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:02,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:03,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:03,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:03,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:03,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:03,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:03,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:03,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:14:03,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:14:03,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:14:03,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:03,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:03,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:06,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:06,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:14:06,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:06,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:14:06,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:14:06,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:14:06,700 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 16:14:06,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:06,765 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 16:14:06,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:14:06,765 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 16:14:06,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:06,766 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:14:06,766 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:14:06,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:14:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:14:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 16:14:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:14:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 16:14:06,769 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 16:14:06,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:06,769 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 16:14:06,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:14:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 16:14:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:14:06,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:06,770 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 16:14:06,770 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:06,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-03 16:14:06,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:06,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:06,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:06,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:08,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:08,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:08,019 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:08,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:08,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:08,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:08,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:14:08,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:14:08,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:14:08,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:08,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:08,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:11,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:11,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:14:11,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:11,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:14:11,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:14:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:14:11,440 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 16:14:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:11,530 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 16:14:11,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:14:11,531 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 16:14:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:11,531 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:14:11,531 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:14:11,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:14:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:14:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:14:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:14:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 16:14:11,534 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 16:14:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:11,534 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 16:14:11,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:14:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 16:14:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:14:11,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:11,534 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 16:14:11,535 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:11,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-03 16:14:11,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:11,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:11,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:12,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:12,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:12,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:12,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:12,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:12,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:12,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:12,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:12,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:12,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:16,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:16,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:14:16,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:16,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:14:16,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:14:16,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:14:16,357 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 16:14:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:16,468 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 16:14:16,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:14:16,468 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 16:14:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:16,469 INFO L225 Difference]: With dead ends: 62 [2018-12-03 16:14:16,469 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:14:16,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:14:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:14:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:14:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:14:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 16:14:16,472 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 16:14:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:16,472 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 16:14:16,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:14:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 16:14:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:14:16,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:16,473 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 16:14:16,473 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:16,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:16,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-03 16:14:16,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:16,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:16,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:16,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:16,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:17,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:17,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:17,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:17,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:17,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:17,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:17,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:14:17,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:14:17,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:14:17,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:17,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:17,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:21,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:21,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 16:14:21,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:21,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:14:21,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:14:21,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:14:21,344 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 16:14:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:21,419 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 16:14:21,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:14:21,420 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 16:14:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:21,421 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:14:21,421 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:14:21,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:14:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:14:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:14:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:14:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 16:14:21,424 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 16:14:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:21,425 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 16:14:21,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:14:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 16:14:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:14:21,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:21,426 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 16:14:21,426 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:21,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:21,426 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-03 16:14:21,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:21,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:21,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:21,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:21,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:22,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:22,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:22,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:22,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:22,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:22,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:22,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:14:22,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:14:22,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:14:22,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:22,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:22,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:26,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:26,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:14:26,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:26,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:14:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:14:26,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:14:26,545 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 16:14:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:26,641 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 16:14:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:14:26,642 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 16:14:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:26,642 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:14:26,643 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:14:26,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:14:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:14:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 16:14:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 16:14:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 16:14:26,646 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 16:14:26,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:26,646 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 16:14:26,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:14:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 16:14:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 16:14:26,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:26,647 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 16:14:26,647 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:26,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-03 16:14:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:26,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:26,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:26,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:27,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:27,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:27,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:27,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:27,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:27,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:27,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:27,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:28,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:28,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:32,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:32,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:14:32,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:32,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:14:32,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:14:32,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:14:32,056 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 16:14:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:32,141 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 16:14:32,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:14:32,141 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 16:14:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:32,142 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:14:32,142 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:14:32,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:14:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:14:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:14:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:14:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 16:14:32,146 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 16:14:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:32,146 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 16:14:32,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:14:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 16:14:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:14:32,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:32,147 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 16:14:32,147 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:32,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-03 16:14:32,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:32,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:32,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:34,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:34,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:34,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:34,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:34,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:34,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:34,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:14:34,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:14:34,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:14:34,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:34,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:34,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:38,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:38,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:14:38,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:38,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:14:38,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:14:38,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:14:38,680 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 16:14:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:38,776 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 16:14:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:14:38,777 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 16:14:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:38,778 INFO L225 Difference]: With dead ends: 66 [2018-12-03 16:14:38,778 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:14:38,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:14:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:14:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:14:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:14:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 16:14:38,781 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 16:14:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:38,781 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 16:14:38,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:14:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 16:14:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:14:38,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:38,782 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 16:14:38,782 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:38,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:38,782 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-03 16:14:38,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:38,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:38,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:40,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:40,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:40,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:40,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:40,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:40,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:40,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:14:40,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:14:40,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:14:40,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:40,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:40,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:44,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:44,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:14:44,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:44,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:14:44,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:14:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:14:44,518 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 16:14:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:44,619 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 16:14:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:14:44,619 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 16:14:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:44,620 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:14:44,620 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:14:44,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:14:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:14:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 16:14:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:14:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 16:14:44,623 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 16:14:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:44,623 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 16:14:44,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:14:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 16:14:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:14:44,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:44,624 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 16:14:44,624 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:44,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-03 16:14:44,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:44,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:44,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:44,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:44,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:46,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:46,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:46,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:46,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:46,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:46,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:46,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:46,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:14:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:46,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:46,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:51,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:51,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:14:51,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:51,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:14:51,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:14:51,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:14:51,025 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 16:14:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:51,155 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 16:14:51,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:14:51,155 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 16:14:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:51,156 INFO L225 Difference]: With dead ends: 68 [2018-12-03 16:14:51,156 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:14:51,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:14:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:14:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:14:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:14:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 16:14:51,159 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 16:14:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:51,159 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 16:14:51,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:14:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 16:14:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:14:51,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:51,160 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 16:14:51,160 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:51,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-03 16:14:51,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:51,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:14:51,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:51,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:14:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:53,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:53,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:14:53,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:14:53,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:14:53,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:14:53,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:14:53,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:14:53,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:14:53,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:14:53,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:14:53,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:14:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:53,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:14:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:14:58,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:14:58,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:14:58,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:14:58,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:14:58,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:14:58,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:14:58,144 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 16:14:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:14:58,254 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 16:14:58,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:14:58,255 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 16:14:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:14:58,255 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:14:58,255 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:14:58,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:14:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:14:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:14:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:14:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 16:14:58,258 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 16:14:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:14:58,258 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 16:14:58,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:14:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 16:14:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:14:58,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:14:58,258 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 16:14:58,259 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:14:58,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:14:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-03 16:14:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:14:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:58,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:14:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:14:58,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:14:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:00,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:00,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:00,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:00,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:00,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:00,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:00,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:15:00,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:15:00,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:15:00,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:15:00,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:00,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:04,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:04,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:15:04,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:04,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:15:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:15:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:15:04,338 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 16:15:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:04,498 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 16:15:04,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:15:04,502 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 16:15:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:04,503 INFO L225 Difference]: With dead ends: 70 [2018-12-03 16:15:04,503 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:15:04,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:15:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:15:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:15:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:15:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 16:15:04,506 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 16:15:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:04,507 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 16:15:04,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:15:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 16:15:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:15:04,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:04,507 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 16:15:04,508 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:04,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-03 16:15:04,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:04,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:15:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:04,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:06,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:06,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:06,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:06,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:06,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:06,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:06,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:06,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:06,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:06,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:10,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:10,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:15:10,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:10,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:15:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:15:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:15:10,788 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 16:15:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:10,875 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 16:15:10,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:15:10,875 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 16:15:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:10,876 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:15:10,876 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:15:10,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:15:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:15:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:15:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:15:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 16:15:10,880 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 16:15:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:10,880 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 16:15:10,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:15:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 16:15:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:15:10,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:10,881 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 16:15:10,881 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:10,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-03 16:15:10,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:10,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:10,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:10,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:10,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:13,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:13,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:13,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:13,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:13,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:13,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:13,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:15:13,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:15:13,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:15:13,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:15:13,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:13,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:17,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:17,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:15:17,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:17,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:15:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:15:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:15:17,976 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 16:15:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:18,081 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 16:15:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:15:18,082 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 16:15:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:18,082 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:15:18,082 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:15:18,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:15:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:15:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 16:15:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:15:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 16:15:18,086 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 16:15:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:18,086 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 16:15:18,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:15:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 16:15:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:15:18,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:18,087 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 16:15:18,087 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:18,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-03 16:15:18,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:18,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:18,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:15:18,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:18,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:19,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:19,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:19,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:19,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:19,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:19,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:19,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:15:19,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:15:19,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:15:19,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:15:19,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:19,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:24,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:24,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:15:24,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:24,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:15:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:15:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:15:24,671 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 16:15:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:25,006 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 16:15:25,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:15:25,006 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 16:15:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:25,007 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:15:25,007 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:15:25,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:15:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:15:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:15:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:15:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 16:15:25,009 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 16:15:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:25,010 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 16:15:25,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:15:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 16:15:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:15:25,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:25,010 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 16:15:25,010 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:25,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-03 16:15:25,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:25,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:15:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:25,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:26,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:26,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:26,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:26,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:26,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:26,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:26,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:26,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:26,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:26,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:31,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:31,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:15:31,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:31,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:15:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:15:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:15:31,758 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 16:15:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:31,846 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 16:15:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:15:31,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 16:15:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:31,847 INFO L225 Difference]: With dead ends: 74 [2018-12-03 16:15:31,847 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 16:15:31,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:15:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 16:15:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 16:15:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:15:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 16:15:31,852 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 16:15:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:31,852 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 16:15:31,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:15:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 16:15:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:15:31,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:31,852 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 16:15:31,852 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:31,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-03 16:15:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:31,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:31,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:33,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:33,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:33,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:33,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:33,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:33,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:33,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:15:33,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:15:33,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:15:33,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:15:33,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:33,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:38,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:38,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 16:15:38,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:38,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:15:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:15:38,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:15:38,838 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 16:15:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:39,044 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 16:15:39,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:15:39,044 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 16:15:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:39,045 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:15:39,045 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:15:39,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:15:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:15:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:15:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:15:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 16:15:39,047 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 16:15:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:39,048 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 16:15:39,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:15:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 16:15:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:15:39,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:39,048 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 16:15:39,048 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:39,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-03 16:15:39,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:39,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:39,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:15:39,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:39,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:41,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:41,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:41,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:41,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:41,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:41,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:41,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:15:41,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:15:41,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:15:41,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:15:41,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:41,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:47,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:47,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:15:47,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:47,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:15:47,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:15:47,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:15:47,571 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 16:15:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:47,761 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 16:15:47,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:15:47,761 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 16:15:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:47,762 INFO L225 Difference]: With dead ends: 76 [2018-12-03 16:15:47,762 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:15:47,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:15:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:15:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 16:15:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:15:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 16:15:47,765 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 16:15:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:47,766 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 16:15:47,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:15:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 16:15:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:15:47,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:47,767 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 16:15:47,767 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:47,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-03 16:15:47,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:47,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:15:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:47,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:49,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:49,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:49,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:49,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:49,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:49,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:49,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:49,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:15:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:50,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:50,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:15:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:55,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:15:55,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:15:55,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:15:55,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:15:55,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:15:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:15:55,398 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 16:15:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:15:55,650 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 16:15:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:15:55,651 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 16:15:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:15:55,652 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:15:55,652 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:15:55,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:15:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:15:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:15:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:15:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 16:15:55,656 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 16:15:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:15:55,656 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 16:15:55,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:15:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 16:15:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:15:55,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:15:55,657 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 16:15:55,658 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:15:55,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:15:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-03 16:15:55,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:15:55,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:55,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:15:55,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:15:55,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:15:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:15:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:57,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:57,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:15:57,558 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:15:57,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:15:57,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:15:57,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:15:57,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:15:57,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:15:57,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:15:57,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:15:57,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:15:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:15:57,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:03,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:03,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:16:03,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:03,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:16:03,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:16:03,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:16:03,286 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 16:16:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:03,423 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 16:16:03,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:16:03,423 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 16:16:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:03,424 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:16:03,424 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:16:03,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:16:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:16:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:16:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:16:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 16:16:03,427 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 16:16:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:03,428 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 16:16:03,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:16:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 16:16:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:16:03,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:03,428 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 16:16:03,429 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:03,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:03,429 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-03 16:16:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:03,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:16:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:03,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:05,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:05,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:05,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:05,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:05,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:05,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:05,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:16:05,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:16:05,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:16:05,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:16:05,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:05,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:11,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:11,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:16:11,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:11,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:16:11,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:16:11,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:16:11,610 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 16:16:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:11,751 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 16:16:11,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:16:11,751 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 16:16:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:11,752 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:16:11,752 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:16:11,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:16:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:16:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:16:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:16:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 16:16:11,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 16:16:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:11,756 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 16:16:11,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:16:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 16:16:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:16:11,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:11,757 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 16:16:11,757 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:11,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-03 16:16:11,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:11,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:11,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:16:11,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:11,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:13,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:13,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:13,761 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:13,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:13,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:13,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:13,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:13,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:13,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:13,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:19,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:19,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:16:19,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:19,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:16:19,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:16:19,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:16:19,647 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 16:16:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:19,788 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 16:16:19,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:16:19,788 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 16:16:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:19,788 INFO L225 Difference]: With dead ends: 80 [2018-12-03 16:16:19,789 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:16:19,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:16:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:16:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:16:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:16:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 16:16:19,792 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 16:16:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:19,792 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 16:16:19,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:16:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 16:16:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:16:19,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:19,793 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 16:16:19,793 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:19,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-03 16:16:19,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:19,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:19,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:21,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:21,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:21,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:21,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:21,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:21,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:21,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:16:21,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:16:22,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:16:22,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:16:22,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:22,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:28,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:28,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:16:28,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:28,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:16:28,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:16:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:16:28,167 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 16:16:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:28,268 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 16:16:28,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:16:28,268 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 16:16:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:28,269 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:16:28,269 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:16:28,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:16:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:16:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:16:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:16:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 16:16:28,273 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 16:16:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:28,273 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 16:16:28,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:16:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 16:16:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:16:28,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:28,274 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 16:16:28,275 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:28,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-03 16:16:28,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:28,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:16:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:28,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:30,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:30,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:30,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:30,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:30,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:30,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:30,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:16:30,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:16:30,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:16:30,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:16:30,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:30,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:36,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:36,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:16:36,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:36,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:16:36,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:16:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:16:36,824 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 16:16:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:36,932 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 16:16:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:16:36,932 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 16:16:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:36,933 INFO L225 Difference]: With dead ends: 82 [2018-12-03 16:16:36,933 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:16:36,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:16:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:16:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 16:16:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:16:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 16:16:36,936 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 16:16:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:36,936 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 16:16:36,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:16:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 16:16:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:16:36,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:36,937 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 16:16:36,937 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:36,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-03 16:16:36,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:36,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:16:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:36,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:39,099 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-03 16:16:39,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:39,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:39,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:39,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:39,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:39,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:39,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:39,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:16:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:39,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:39,180 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-03 16:16:39,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:45,648 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-03 16:16:45,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:45,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:16:45,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:45,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:16:45,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:16:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:16:45,668 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 16:16:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:46,040 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 16:16:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:16:46,041 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 16:16:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:46,041 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:16:46,041 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:16:46,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:16:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:16:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:16:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:16:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 16:16:46,045 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 16:16:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:46,045 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 16:16:46,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:16:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 16:16:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:16:46,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:46,046 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 16:16:46,046 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:46,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-03 16:16:46,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:46,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:16:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:46,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:48,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:48,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:48,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:48,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:48,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:48,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:48,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:16:48,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:16:48,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:16:48,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:16:48,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:48,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:16:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:55,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:16:55,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:16:55,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:16:55,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:16:55,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:16:55,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:16:55,535 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 16:16:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:16:56,150 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 16:16:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:16:56,151 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 16:16:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:16:56,151 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:16:56,152 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:16:56,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:16:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:16:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 16:16:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:16:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 16:16:56,155 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 16:16:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:16:56,155 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 16:16:56,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:16:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 16:16:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:16:56,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:16:56,156 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 16:16:56,156 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:16:56,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:16:56,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-03 16:16:56,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:16:56,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:56,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:16:56,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:16:56,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:16:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:16:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:58,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:58,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:16:58,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:16:58,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:16:58,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:16:58,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:16:58,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:16:58,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:16:58,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:16:58,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:16:58,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:16:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:16:58,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:05,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:05,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:17:05,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:05,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:17:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:17:05,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:17:05,694 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 16:17:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:05,837 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 16:17:05,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:17:05,838 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 16:17:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:05,838 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:17:05,838 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:17:05,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:17:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:17:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:17:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:17:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 16:17:05,842 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 16:17:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:05,842 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 16:17:05,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:17:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 16:17:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:17:05,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:05,843 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 16:17:05,843 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:05,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-03 16:17:05,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:05,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:05,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:17:05,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:05,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:08,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:08,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:08,819 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:08,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:08,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:08,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:08,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:08,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:17:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:08,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:08,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:15,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:15,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:17:15,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:15,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:17:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:17:15,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:17:15,661 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 16:17:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:15,767 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 16:17:15,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:17:15,768 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 16:17:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:15,768 INFO L225 Difference]: With dead ends: 86 [2018-12-03 16:17:15,768 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:17:15,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:17:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:17:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:17:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:17:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 16:17:15,771 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 16:17:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:15,771 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 16:17:15,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:17:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 16:17:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:17:15,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:15,772 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 16:17:15,772 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:15,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-03 16:17:15,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:15,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:15,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:18,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:18,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:18,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:18,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:18,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:18,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:18,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:17:18,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:17:18,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 16:17:18,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:17:18,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:18,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:25,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:25,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 16:17:25,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:25,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:17:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:17:25,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:17:25,680 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 16:17:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:25,859 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 16:17:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:17:25,860 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 16:17:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:25,860 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:17:25,860 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:17:25,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:17:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:17:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:17:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:17:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 16:17:25,863 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 16:17:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:25,863 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 16:17:25,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:17:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 16:17:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:17:25,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:25,864 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 16:17:25,864 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:25,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-03 16:17:25,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:25,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:17:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:25,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:28,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:28,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:28,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:28,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:28,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:28,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:28,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:17:28,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:17:28,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:17:28,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:17:28,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:28,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:35,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:35,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 16:17:35,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:35,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:17:35,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:17:35,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:17:35,859 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 16:17:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:36,022 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 16:17:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:17:36,022 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 16:17:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:36,023 INFO L225 Difference]: With dead ends: 88 [2018-12-03 16:17:36,023 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:17:36,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:17:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:17:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:17:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:17:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 16:17:36,025 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 16:17:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:36,025 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 16:17:36,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:17:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 16:17:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:17:36,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:36,026 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 16:17:36,026 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:36,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-03 16:17:36,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:36,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:36,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:17:36,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:36,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:38,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:38,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:38,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:38,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:38,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:38,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:38,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:38,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:17:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:39,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:39,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:46,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:46,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 16:17:46,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:46,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:17:46,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:17:46,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:17:46,473 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 16:17:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:46,696 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 16:17:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:17:46,697 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 16:17:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:46,697 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:17:46,697 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:17:46,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:17:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:17:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:17:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:17:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 16:17:46,700 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 16:17:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:46,700 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 16:17:46,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:17:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 16:17:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:17:46,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:46,701 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 16:17:46,701 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:46,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:46,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-03 16:17:46,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:46,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:46,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:17:46,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:46,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:49,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:49,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:49,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:49,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:49,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:49,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:49,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:17:49,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:17:49,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:17:49,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:17:49,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:17:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:49,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:17:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:57,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:17:57,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 16:17:57,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:17:57,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:17:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:17:57,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:17:57,049 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 16:17:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:17:57,185 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 16:17:57,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:17:57,185 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 16:17:57,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:17:57,186 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:17:57,186 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:17:57,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:17:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:17:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:17:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:17:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 16:17:57,189 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 16:17:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:17:57,189 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 16:17:57,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:17:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 16:17:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:17:57,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:17:57,190 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 16:17:57,190 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:17:57,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:17:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-03 16:17:57,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:17:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:57,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:17:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:17:57,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:17:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:17:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:17:59,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:59,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:17:59,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:17:59,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:17:59,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:17:59,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:17:59,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:17:59,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:18:00,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:18:00,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:18:00,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:00,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:07,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:07,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 16:18:07,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:07,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 16:18:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 16:18:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:18:07,708 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 16:18:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:07,858 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 16:18:07,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:18:07,858 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 16:18:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:07,859 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:18:07,859 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:18:07,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:18:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:18:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:18:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:18:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 16:18:07,862 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 16:18:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:07,862 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 16:18:07,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 16:18:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 16:18:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:18:07,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:07,863 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 16:18:07,864 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:07,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-03 16:18:07,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:07,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:18:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:07,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:10,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:10,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:10,617 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:18:10,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:18:10,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:10,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:18:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:10,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:10,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:10,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:18,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:18,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:18:18,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:18,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:18:18,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:18:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:18:18,494 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 16:18:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:18,845 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 16:18:18,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:18:18,845 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 16:18:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:18,846 INFO L225 Difference]: With dead ends: 92 [2018-12-03 16:18:18,846 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:18:18,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:18:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:18:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:18:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:18:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 16:18:18,849 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 16:18:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:18,849 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 16:18:18,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:18:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 16:18:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:18:18,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:18,850 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 16:18:18,851 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:18,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-03 16:18:18,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:18,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:18,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:21,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:21,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:21,741 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:18:21,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:18:21,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:21,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:18:21,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:18:21,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:18:21,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 16:18:21,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:18:21,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:21,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:30,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:30,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 16:18:30,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:30,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:18:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:18:30,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:18:30,184 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 16:18:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:30,388 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 16:18:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:18:30,389 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 16:18:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:30,389 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:18:30,389 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:18:30,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:18:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:18:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:18:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:18:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 16:18:30,392 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 16:18:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:30,392 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 16:18:30,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:18:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 16:18:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:18:30,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:30,393 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 16:18:30,393 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:30,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-03 16:18:30,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:30,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:30,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:18:30,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:30,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:33,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:33,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:33,269 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:18:33,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:18:33,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:33,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:18:33,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:18:33,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:18:33,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:18:33,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:18:33,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:33,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:41,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:41,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:18:41,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:41,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:18:41,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:18:41,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:18:41,941 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 16:18:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:42,066 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 16:18:42,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:18:42,067 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 16:18:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:42,067 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:18:42,067 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:18:42,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:18:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:18:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:18:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:18:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 16:18:42,071 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 16:18:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:42,072 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 16:18:42,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:18:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 16:18:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:18:42,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:42,072 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 16:18:42,072 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:42,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-03 16:18:42,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:42,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:42,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:18:42,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:42,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:44,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:44,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:44,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:18:44,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:18:44,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:44,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:18:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:45,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:18:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:45,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:45,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:18:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:18:53,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:18:53,476 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:18:53,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:18:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:18:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:18:53,478 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 16:18:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:18:53,700 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 16:18:53,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:18:53,700 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 16:18:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:18:53,701 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:18:53,701 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:18:53,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:18:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:18:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:18:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:18:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 16:18:53,704 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 16:18:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:18:53,704 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 16:18:53,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:18:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 16:18:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:18:53,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:18:53,705 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 16:18:53,705 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:18:53,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:18:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-03 16:18:53,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:18:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:53,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:18:53,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:18:53,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:18:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:18:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:56,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:56,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:18:56,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:18:56,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:18:56,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:18:56,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:18:56,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:18:56,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:18:56,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:18:56,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:18:56,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:18:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:18:56,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:05,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:05,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 16:19:05,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:05,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:19:05,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:19:05,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:19:05,766 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 16:19:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:05,896 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 16:19:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:19:05,897 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 16:19:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:05,898 INFO L225 Difference]: With dead ends: 96 [2018-12-03 16:19:05,898 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:19:05,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:19:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:19:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:19:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:19:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 16:19:05,902 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 16:19:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:05,902 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 16:19:05,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:19:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 16:19:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:19:05,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:05,902 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 16:19:05,903 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:05,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:05,903 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-03 16:19:05,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:05,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:19:05,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:05,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:08,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:08,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:08,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:19:08,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:19:08,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:08,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:19:08,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:19:08,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:19:08,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:19:08,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:19:08,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:08,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:17,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:17,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 16:19:17,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:17,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:19:17,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:19:17,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:19:17,839 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 16:19:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:18,080 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 16:19:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:19:18,080 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 16:19:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:18,081 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:19:18,081 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:19:18,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:19:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:19:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:19:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:19:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 16:19:18,085 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 16:19:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:18,085 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 16:19:18,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:19:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 16:19:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:19:18,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:18,086 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 16:19:18,086 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:18,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-03 16:19:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:18,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:19:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:18,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:21,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:21,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:21,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:19:21,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:19:21,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:21,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:19:21,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:21,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:19:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:21,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:21,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:30,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:30,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 16:19:30,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:30,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:19:30,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:19:30,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:19:30,274 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 16:19:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:30,460 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 16:19:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:19:30,461 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 16:19:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:30,461 INFO L225 Difference]: With dead ends: 98 [2018-12-03 16:19:30,461 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:19:30,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:19:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:19:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:19:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:19:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 16:19:30,464 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 16:19:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:30,464 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 16:19:30,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:19:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 16:19:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:19:30,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:30,465 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 16:19:30,465 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:30,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:30,465 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-03 16:19:30,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:30,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:30,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:33,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:33,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:33,743 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:19:33,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:19:33,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:33,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:19:33,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:19:33,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:19:33,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 16:19:33,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:19:33,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:33,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:43,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:43,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 16:19:43,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:43,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:19:43,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:19:43,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:19:43,291 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 16:19:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:43,437 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 16:19:43,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:19:43,437 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 16:19:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:43,438 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:19:43,438 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:19:43,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:19:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:19:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:19:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:19:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 16:19:43,441 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 16:19:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:43,441 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 16:19:43,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:19:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 16:19:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:19:43,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:43,442 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 16:19:43,442 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:43,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:43,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-03 16:19:43,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:43,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:19:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:43,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:46,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:46,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:46,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:19:46,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:19:46,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:46,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:19:46,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:19:46,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:19:46,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:19:46,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:19:46,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:19:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:46,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:19:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:56,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:19:56,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 16:19:56,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:19:56,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:19:56,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:19:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:19:56,491 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 16:19:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:19:56,635 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 16:19:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:19:56,635 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 16:19:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:19:56,636 INFO L225 Difference]: With dead ends: 100 [2018-12-03 16:19:56,636 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:19:56,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:19:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:19:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:19:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:19:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 16:19:56,640 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 16:19:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:19:56,640 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 16:19:56,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:19:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 16:19:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:19:56,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:19:56,640 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 16:19:56,641 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:19:56,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:19:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-03 16:19:56,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:19:56,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:56,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:19:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:19:56,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:19:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:19:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:19:59,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:59,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:19:59,914 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:19:59,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:19:59,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:19:59,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:19:59,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:19:59,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:19:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:00,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:00,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:09,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:09,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 16:20:09,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:09,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:20:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:20:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:20:09,879 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 16:20:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:10,025 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 16:20:10,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:20:10,026 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 16:20:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:10,027 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:20:10,027 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:20:10,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:20:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:20:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:20:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:20:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 16:20:10,031 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 16:20:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:10,032 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 16:20:10,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:20:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 16:20:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:20:10,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:10,033 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 16:20:10,033 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:10,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-03 16:20:10,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:10,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:10,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:10,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:10,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:13,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:13,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:13,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:20:13,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:20:13,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:13,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:13,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:20:13,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:20:13,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:20:13,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:20:13,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:13,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:23,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:23,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 16:20:23,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:23,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:20:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:20:23,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:20:23,689 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 16:20:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:23,854 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 16:20:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:20:23,855 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 16:20:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:23,855 INFO L225 Difference]: With dead ends: 102 [2018-12-03 16:20:23,855 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:20:23,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:20:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:20:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:20:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:20:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 16:20:23,859 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 16:20:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:23,859 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 16:20:23,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:20:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 16:20:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:20:23,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:23,860 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 16:20:23,860 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:23,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:23,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-03 16:20:23,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:23,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:23,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:20:23,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:23,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:27,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:27,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:27,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:20:27,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:20:27,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:27,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:27,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:20:27,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:20:27,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:20:27,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:20:27,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:27,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:37,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:37,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 16:20:37,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:37,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 16:20:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 16:20:37,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:20:37,749 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 16:20:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:37,953 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 16:20:37,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:20:37,953 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 16:20:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:37,954 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:20:37,954 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:20:37,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:20:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:20:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:20:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:20:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 16:20:37,957 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 16:20:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:37,958 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 16:20:37,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 16:20:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 16:20:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:20:37,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:37,958 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 16:20:37,958 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:37,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-03 16:20:37,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:37,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:37,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:20:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:37,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:41,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:41,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:41,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:20:41,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:20:41,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:41,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:41,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:41,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:20:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:41,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:41,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:20:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:51,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:20:51,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 16:20:51,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:20:51,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:20:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:20:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:20:51,852 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 16:20:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:20:52,154 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 16:20:52,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:20:52,154 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 16:20:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:20:52,155 INFO L225 Difference]: With dead ends: 104 [2018-12-03 16:20:52,155 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:20:52,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:20:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:20:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:20:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:20:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 16:20:52,159 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 16:20:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:20:52,159 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 16:20:52,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:20:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 16:20:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:20:52,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:20:52,160 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 16:20:52,160 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:20:52,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:20:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-03 16:20:52,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:20:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:52,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:20:52,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:20:52,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:20:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:20:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:55,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:55,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:20:55,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:20:55,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:20:55,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:20:55,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:20:55,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:20:55,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:20:55,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 16:20:55,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:20:55,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:20:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:20:55,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:21:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:06,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:21:06,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 16:21:06,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:21:06,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:21:06,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:21:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:21:06,374 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 16:21:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:06,617 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 16:21:06,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:21:06,617 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 16:21:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:06,618 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:21:06,618 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:21:06,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:21:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:21:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:21:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:21:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 16:21:06,621 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 16:21:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:06,621 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 16:21:06,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:21:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 16:21:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:21:06,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:06,622 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 16:21:06,622 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:06,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:06,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-03 16:21:06,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:06,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:06,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:21:06,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:06,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:10,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:10,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:21:10,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:21:10,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:21:10,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:10,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:21:10,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:21:10,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:21:10,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:21:10,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:21:10,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:21:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:10,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:21:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:21,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:21:21,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 16:21:21,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:21:21,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:21:21,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:21:21,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:21:21,098 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 16:21:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:21,362 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 16:21:21,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:21:21,362 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 16:21:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:21,363 INFO L225 Difference]: With dead ends: 106 [2018-12-03 16:21:21,363 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:21:21,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:21:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:21:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:21:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:21:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 16:21:21,367 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 16:21:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:21,367 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 16:21:21,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:21:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 16:21:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:21:21,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:21,368 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 16:21:21,368 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:21,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:21,368 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-03 16:21:21,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:21,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:21,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:21:21,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:21,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:25,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:25,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:21:25,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:21:25,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:21:25,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:25,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:21:25,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:25,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:21:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:25,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:21:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:25,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:21:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:36,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:21:36,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 16:21:36,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:21:36,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 16:21:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 16:21:36,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:21:36,118 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 16:21:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:36,291 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 16:21:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:21:36,292 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 16:21:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:36,293 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:21:36,293 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:21:36,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:21:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:21:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:21:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:21:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 16:21:36,298 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 16:21:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:36,298 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 16:21:36,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 16:21:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 16:21:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:21:36,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:36,299 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 16:21:36,299 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:36,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-03 16:21:36,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:36,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:36,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:21:36,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:36,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:40,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:40,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:21:40,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:21:40,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:21:40,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:40,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:21:40,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:21:40,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:21:40,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:21:40,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:21:40,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:21:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:40,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:21:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:51,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:21:51,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 16:21:51,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:21:51,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:21:51,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:21:51,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:21:51,368 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 16:21:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:21:51,692 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 16:21:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:21:51,692 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 16:21:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:21:51,693 INFO L225 Difference]: With dead ends: 108 [2018-12-03 16:21:51,694 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:21:51,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:21:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:21:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:21:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:21:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 16:21:51,698 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 16:21:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:21:51,698 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 16:21:51,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:21:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 16:21:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:21:51,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:21:51,699 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 16:21:51,699 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:21:51,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:21:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-03 16:21:51,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:21:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:51,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:21:51,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:21:51,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:21:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:21:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:55,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:55,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:21:55,682 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:21:55,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:21:55,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:21:55,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:21:55,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:21:55,692 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:21:55,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:21:55,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:21:55,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:21:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:21:55,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:07,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:07,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 16:22:07,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:07,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 16:22:07,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 16:22:07,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:22:07,289 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 16:22:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:07,574 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 16:22:07,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:22:07,575 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 16:22:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:07,575 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:22:07,575 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:22:07,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:22:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:22:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:22:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:22:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 16:22:07,579 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 16:22:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:07,580 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 16:22:07,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 16:22:07,580 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 16:22:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:22:07,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:07,580 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 16:22:07,581 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:07,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-03 16:22:07,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:07,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:07,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:22:07,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:07,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:11,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:11,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:22:11,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:22:11,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:22:11,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:11,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:22:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:11,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:22:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:11,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:22:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:11,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:23,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:23,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 16:22:23,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:23,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:22:23,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:22:23,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:22:23,408 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 16:22:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:23,642 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 16:22:23,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 16:22:23,642 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 16:22:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:23,642 INFO L225 Difference]: With dead ends: 110 [2018-12-03 16:22:23,642 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:22:23,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:22:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:22:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:22:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:22:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 16:22:23,646 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 16:22:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:23,646 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 16:22:23,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:22:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 16:22:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:22:23,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:23,647 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 16:22:23,647 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:23,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-03 16:22:23,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:23,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:22:23,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:23,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:27,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:27,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:22:27,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:22:27,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:22:27,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:27,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:22:27,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:22:27,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:22:27,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 16:22:27,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:22:27,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:22:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:27,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:39,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:39,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 16:22:39,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:39,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 16:22:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 16:22:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:22:39,514 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 16:22:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:39,743 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 16:22:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:22:39,743 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 16:22:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:39,743 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:22:39,743 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:22:39,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:22:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:22:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:22:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:22:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 16:22:39,746 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 16:22:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:39,747 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 16:22:39,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 16:22:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 16:22:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:22:39,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:39,747 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 16:22:39,747 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:39,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-03 16:22:39,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:39,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:39,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:22:39,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:39,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:22:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:43,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:43,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:22:43,873 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:22:43,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:22:43,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:22:43,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:22:43,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:22:43,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:22:43,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:22:43,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:22:43,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:22:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:43,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:22:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:22:56,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:22:56,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 16:22:56,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:22:56,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:22:56,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:22:56,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:22:56,457 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 16:22:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:22:56,702 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 16:22:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 16:22:56,702 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 16:22:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:22:56,703 INFO L225 Difference]: With dead ends: 112 [2018-12-03 16:22:56,703 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:22:56,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:22:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:22:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:22:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:22:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 16:22:56,707 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 16:22:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:22:56,707 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 16:22:56,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:22:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 16:22:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 16:22:56,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:22:56,708 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 16:22:56,708 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:22:56,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:22:56,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-03 16:22:56,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:22:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:56,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:22:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:22:56,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:22:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:00,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:00,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:23:00,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:23:00,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:23:00,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:00,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:23:00,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:00,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:23:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:00,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:23:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:01,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:23:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:13,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:23:13,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 16:23:13,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:23:13,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 16:23:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 16:23:13,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:23:13,232 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 16:23:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:13,504 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 16:23:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 16:23:13,504 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 16:23:13,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:13,505 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:23:13,505 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:23:13,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:23:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:23:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:23:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:23:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 16:23:13,509 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 16:23:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:13,509 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 16:23:13,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 16:23:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 16:23:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:23:13,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:13,510 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 16:23:13,510 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:13,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-03 16:23:13,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:13,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:13,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:17,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:17,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:23:17,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:23:17,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:23:17,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:17,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:23:17,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:23:17,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:23:17,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 16:23:17,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:23:17,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:23:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:17,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:23:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:30,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:23:30,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 16:23:30,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:23:30,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:23:30,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:23:30,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:23:30,393 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 16:23:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:30,722 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 16:23:30,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:23:30,723 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 16:23:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:30,723 INFO L225 Difference]: With dead ends: 114 [2018-12-03 16:23:30,723 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:23:30,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:23:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:23:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:23:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:23:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 16:23:30,727 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 16:23:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:30,727 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 16:23:30,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:23:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 16:23:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:23:30,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:30,728 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 16:23:30,728 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:30,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-03 16:23:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:30,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:23:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:30,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:35,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:35,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:23:35,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:23:35,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:23:35,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:35,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:23:35,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:23:35,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:23:35,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:23:35,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:23:35,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:23:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:35,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:23:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:47,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:23:47,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 16:23:47,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:23:47,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 16:23:47,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 16:23:47,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:23:47,899 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 16:23:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:23:48,168 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 16:23:48,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 16:23:48,175 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 16:23:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:23:48,175 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:23:48,176 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:23:48,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:23:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:23:48,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 16:23:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:23:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 16:23:48,179 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 16:23:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:23:48,180 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 16:23:48,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 16:23:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 16:23:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:23:48,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:23:48,181 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 16:23:48,181 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:23:48,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:23:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-03 16:23:48,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:23:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:48,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:23:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:23:48,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:23:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:52,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:52,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:23:52,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:23:52,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:23:52,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:23:52,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:23:52,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:23:52,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:23:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:23:52,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:23:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:23:52,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:05,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:05,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 16:24:05,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:05,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:24:05,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:24:05,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:24:05,722 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 16:24:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:05,948 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 16:24:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 16:24:05,949 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 16:24:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:05,949 INFO L225 Difference]: With dead ends: 116 [2018-12-03 16:24:05,949 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:24:05,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:24:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:24:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 16:24:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:24:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 16:24:05,953 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 16:24:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:05,953 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 16:24:05,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:24:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 16:24:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:24:05,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:05,954 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 16:24:05,954 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:05,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2018-12-03 16:24:05,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:05,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:05,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:05,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:05,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:10,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:10,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:10,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:10,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:10,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:10,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:10,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:10,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:10,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 16:24:10,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:10,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:10,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:24,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-03 16:24:24,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:24,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 16:24:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 16:24:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:24:24,209 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-03 16:24:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:24,551 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 16:24:24,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 16:24:24,552 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 16:24:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:24,552 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:24:24,552 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:24:24,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:24:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:24:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:24:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:24:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 16:24:24,556 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-03 16:24:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:24,556 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 16:24:24,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 16:24:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 16:24:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:24:24,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:24,557 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-03 16:24:24,557 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:24,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2018-12-03 16:24:24,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:24,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:24,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:29,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:29,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:29,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:29,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:24:29,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:29,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:29,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:29,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:29,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:29,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:42,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:42,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-03 16:24:42,510 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:42,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 16:24:42,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 16:24:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 16:24:42,512 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-12-03 16:24:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:42,812 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 16:24:42,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 16:24:42,812 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-12-03 16:24:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:42,812 INFO L225 Difference]: With dead ends: 118 [2018-12-03 16:24:42,812 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:24:42,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 16:24:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:24:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 16:24:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:24:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 16:24:42,817 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-12-03 16:24:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:42,817 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 16:24:42,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 16:24:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 16:24:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 16:24:42,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:42,818 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-12-03 16:24:42,818 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:42,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1991455747, now seen corresponding path program 112 times [2018-12-03 16:24:42,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:42,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:42,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat