java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:44:47,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:44:47,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:44:47,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:44:47,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:44:47,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:44:47,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:44:47,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:44:47,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:44:47,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:44:47,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:44:47,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:44:47,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:44:47,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:44:47,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:44:47,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:44:47,610 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:44:47,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:44:47,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:44:47,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:44:47,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:44:47,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:44:47,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:44:47,621 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:44:47,621 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:44:47,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:44:47,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:44:47,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:44:47,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:44:47,626 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:44:47,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:44:47,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:44:47,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:44:47,627 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:44:47,628 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:44:47,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:44:47,630 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:44:47,642 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:44:47,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:44:47,644 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:44:47,644 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:44:47,644 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:44:47,644 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:44:47,645 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:44:47,645 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:44:47,645 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:44:47,645 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:44:47,646 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:44:47,646 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:44:47,646 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:44:47,646 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:44:47,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:44:47,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:44:47,647 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:44:47,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:44:47,648 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:44:47,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:44:47,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:44:47,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:44:47,649 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:44:47,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:44:47,649 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:44:47,649 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:44:47,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:44:47,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:44:47,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:44:47,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:44:47,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:44:47,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:47,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:44:47,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:44:47,651 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:44:47,652 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:44:47,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:44:47,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:44:47,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:44:47,653 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:44:47,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:44:47,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:44:47,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:44:47,716 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:44:47,717 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:44:47,718 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2019-02-15 10:44:47,718 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-02-15 10:44:47,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:44:47,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:44:47,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:47,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:44:47,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:44:47,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:47,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:44:47,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:44:47,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:44:47,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:44:47,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:44:47,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:44:47,842 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:44:47,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:44:47,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:44:48,185 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:44:48,185 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-15 10:44:48,187 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:48 BoogieIcfgContainer [2019-02-15 10:44:48,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:44:48,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:44:48,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:44:48,192 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:44:48,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/2) ... [2019-02-15 10:44:48,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f76baf and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:44:48, skipping insertion in model container [2019-02-15 10:44:48,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:48" (2/2) ... [2019-02-15 10:44:48,197 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-02-15 10:44:48,207 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:44:48,215 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 10:44:48,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 10:44:48,267 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:44:48,267 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:44:48,267 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:44:48,267 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:44:48,267 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:44:48,268 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:44:48,268 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:44:48,268 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:44:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-15 10:44:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:44:48,302 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:48,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:44:48,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:48,317 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-15 10:44:48,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:48,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:48,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:44:48,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:44:48,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:44:48,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:44:48,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:44:48,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:44:48,479 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-15 10:44:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:48,575 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-15 10:44:48,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:44:48,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 10:44:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:48,588 INFO L225 Difference]: With dead ends: 12 [2019-02-15 10:44:48,588 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 10:44:48,591 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 [2019-02-15 10:44:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 10:44:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-15 10:44:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 10:44:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-15 10:44:48,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-15 10:44:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:48,628 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-15 10:44:48,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:44:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-15 10:44:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:44:48,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:48,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:44:48,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-15 10:44:48,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:48,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:44:48,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:48,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:48,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:44:48,802 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-15 10:44:48,867 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:44:48,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:44:49,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:44:49,125 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 166 root evaluator evaluations with a maximum evaluation depth of 5. Performed 166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:44:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:49,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:44:49,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:49,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:49,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:49,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:44:49,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:44:49,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:49,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-15 10:44:49,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:49,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:44:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:44:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-15 10:44:49,355 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-15 10:44:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:49,405 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-15 10:44:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:44:49,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-15 10:44:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:49,407 INFO L225 Difference]: With dead ends: 13 [2019-02-15 10:44:49,407 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 10:44:49,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-15 10:44:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 10:44:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-15 10:44:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-15 10:44:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-15 10:44:49,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-15 10:44:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:49,413 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-15 10:44:49,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:44:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-15 10:44:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:44:49,414 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:49,414 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-15 10:44:49,414 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-15 10:44:49,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:49,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:49,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:44:49,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:49,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:49,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:49,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:49,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:49,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:49,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:44:49,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:49,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:44:49,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:44:49,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:49,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-15 10:44:49,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:49,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 10:44:49,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 10:44:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:44:49,814 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-15 10:44:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:49,974 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-15 10:44:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:44:49,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-15 10:44:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:49,976 INFO L225 Difference]: With dead ends: 16 [2019-02-15 10:44:49,976 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 10:44:49,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:44:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 10:44:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-15 10:44:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 10:44:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-15 10:44:49,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-15 10:44:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:49,980 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-15 10:44:49,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 10:44:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-15 10:44:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:44:49,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:49,981 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-15 10:44:49,982 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-15 10:44:49,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:49,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:49,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:49,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:49,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 10:44:50,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:50,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:50,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:50,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:50,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:50,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:50,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:50,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:50,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:50,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:50,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 10:44:50,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 10:44:50,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:50,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-15 10:44:50,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:50,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:44:50,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:44:50,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:44:50,349 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-15 10:44:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:50,401 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-15 10:44:50,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:44:50,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-15 10:44:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:50,403 INFO L225 Difference]: With dead ends: 19 [2019-02-15 10:44:50,403 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 10:44:50,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:44:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 10:44:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-15 10:44:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:44:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-15 10:44:50,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-15 10:44:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:50,410 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-15 10:44:50,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:44:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-15 10:44:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-15 10:44:50,410 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:50,411 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-15 10:44:50,411 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:50,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-15 10:44:50,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:50,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:50,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 10:44:50,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:50,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:50,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:50,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:50,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:50,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:50,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:50,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:50,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 10:44:50,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 10:44:50,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:50,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-15 10:44:50,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:50,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:44:50,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:44:50,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:44:50,752 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-15 10:44:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:50,835 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-15 10:44:50,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:44:50,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-15 10:44:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:50,836 INFO L225 Difference]: With dead ends: 22 [2019-02-15 10:44:50,836 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 10:44:50,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:44:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 10:44:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-15 10:44:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 10:44:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-15 10:44:50,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-15 10:44:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:50,841 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-15 10:44:50,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:44:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-15 10:44:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-15 10:44:50,842 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:50,842 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-15 10:44:50,842 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:50,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:50,843 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-15 10:44:50,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:50,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 10:44:51,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:51,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:51,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:51,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:51,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:51,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:44:51,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:51,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 10:44:51,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 10:44:51,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:51,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-15 10:44:51,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:51,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:44:51,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:44:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:44:51,558 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-15 10:44:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:51,636 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-15 10:44:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:44:51,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-15 10:44:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:51,638 INFO L225 Difference]: With dead ends: 25 [2019-02-15 10:44:51,638 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 10:44:51,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:44:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 10:44:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-15 10:44:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:44:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-15 10:44:51,644 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-15 10:44:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:51,644 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-15 10:44:51,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:44:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-15 10:44:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-15 10:44:51,645 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:51,646 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-15 10:44:51,652 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-15 10:44:51,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:51,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:51,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 10:44:51,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:51,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:51,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:51,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:51,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:51,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:51,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:51,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:51,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 10:44:51,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 10:44:52,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:52,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-15 10:44:52,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:52,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:44:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:44:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:44:52,087 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-15 10:44:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:52,144 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-15 10:44:52,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:44:52,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-15 10:44:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:52,149 INFO L225 Difference]: With dead ends: 28 [2019-02-15 10:44:52,149 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 10:44:52,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:44:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 10:44:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-15 10:44:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 10:44:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-15 10:44:52,153 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-15 10:44:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:52,154 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-15 10:44:52,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:44:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-15 10:44:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-15 10:44:52,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:52,155 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-15 10:44:52,155 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:52,155 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-15 10:44:52,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:52,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:52,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 10:44:52,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:52,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:52,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:52,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:52,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:52,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:52,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:52,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:52,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 10:44:52,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 10:44:52,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:52,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-15 10:44:52,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:52,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:44:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:44:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:44:52,605 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-15 10:44:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:52,700 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-15 10:44:52,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:44:52,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-15 10:44:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:52,703 INFO L225 Difference]: With dead ends: 31 [2019-02-15 10:44:52,704 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 10:44:52,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:44:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 10:44:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-15 10:44:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 10:44:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-15 10:44:52,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-15 10:44:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:52,708 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-15 10:44:52,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:44:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-15 10:44:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-15 10:44:52,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:52,709 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-15 10:44:52,710 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-15 10:44:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 10:44:52,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:52,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:52,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:52,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:52,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:52,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:52,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:52,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:52,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-15 10:44:52,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:52,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 10:44:53,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 10:44:53,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:53,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-15 10:44:53,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:53,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:44:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:44:53,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:44:53,234 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-15 10:44:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:53,395 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-15 10:44:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:44:53,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-15 10:44:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:53,397 INFO L225 Difference]: With dead ends: 34 [2019-02-15 10:44:53,397 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 10:44:53,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:44:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 10:44:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-15 10:44:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 10:44:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-15 10:44:53,402 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-15 10:44:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:53,404 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-15 10:44:53,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:44:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-15 10:44:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-15 10:44:53,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:53,406 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-15 10:44:53,406 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:53,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:53,406 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-15 10:44:53,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:53,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:53,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 10:44:53,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:53,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:53,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:53,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:53,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:53,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:53,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:53,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:53,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:53,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:53,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 10:44:53,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 10:44:53,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:53,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-15 10:44:53,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:53,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:44:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:44:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:44:53,946 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-15 10:44:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:54,021 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-15 10:44:54,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:44:54,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-15 10:44:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:54,022 INFO L225 Difference]: With dead ends: 37 [2019-02-15 10:44:54,023 INFO L226 Difference]: Without dead ends: 25 [2019-02-15 10:44:54,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:44:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-15 10:44:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-15 10:44:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 10:44:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-15 10:44:54,028 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-15 10:44:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:54,029 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-15 10:44:54,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:44:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-15 10:44:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-15 10:44:54,030 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:54,030 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-15 10:44:54,030 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:54,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:54,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-15 10:44:54,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 10:44:54,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:54,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:54,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:54,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:54,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:54,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:54,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 10:44:54,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 10:44:54,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:54,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-15 10:44:54,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:54,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:44:54,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:44:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-15 10:44:54,885 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-15 10:44:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:54,940 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-15 10:44:54,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 10:44:54,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-15 10:44:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:54,942 INFO L225 Difference]: With dead ends: 40 [2019-02-15 10:44:54,942 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 10:44:54,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-15 10:44:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 10:44:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-15 10:44:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-15 10:44:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-15 10:44:54,947 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-15 10:44:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:54,947 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-15 10:44:54,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:44:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-15 10:44:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-15 10:44:54,948 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:54,948 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-15 10:44:54,948 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-15 10:44:54,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:54,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:54,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 10:44:55,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:55,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:55,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:55,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:55,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:55,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:55,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:55,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:55,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-15 10:44:55,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:55,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:55,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:44:55,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:55,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:55,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-02-15 10:44:55,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2019-02-15 10:44:55,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 10:44:55,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:55,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-02-15 10:44:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 10:44:55,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 10:44:56,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:56,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2019-02-15 10:44:56,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:56,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-15 10:44:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-15 10:44:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 10:44:56,752 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-02-15 10:44:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:59,311 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-15 10:44:59,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 10:44:59,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-02-15 10:44:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:59,313 INFO L225 Difference]: With dead ends: 43 [2019-02-15 10:44:59,313 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 10:44:59,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2019-02-15 10:44:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 10:44:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-15 10:44:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:44:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-15 10:44:59,320 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-15 10:44:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:59,320 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-15 10:44:59,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-15 10:44:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-15 10:44:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-15 10:44:59,321 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:59,322 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-15 10:44:59,322 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-15 10:44:59,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:59,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 10:44:59,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:59,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:59,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:59,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:59,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:59,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:59,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:59,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:59,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:59,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:59,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 10:44:59,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 10:44:59,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:59,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-15 10:44:59,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:59,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-15 10:44:59,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-15 10:44:59,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-15 10:44:59,795 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-15 10:44:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:59,873 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-15 10:44:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 10:44:59,873 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-15 10:44:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:59,874 INFO L225 Difference]: With dead ends: 46 [2019-02-15 10:44:59,874 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 10:44:59,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-15 10:44:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 10:44:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-15 10:44:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:44:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-15 10:44:59,881 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-15 10:44:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:59,882 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-15 10:44:59,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-15 10:44:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-15 10:44:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-15 10:44:59,883 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:59,883 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-15 10:44:59,883 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:59,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:59,883 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-15 10:44:59,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:59,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:59,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 10:45:00,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:00,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:00,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:00,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:00,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:00,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:00,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:00,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:00,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 10:45:00,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 10:45:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:00,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-15 10:45:00,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:00,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-15 10:45:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-15 10:45:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-15 10:45:00,549 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-15 10:45:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:00,608 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-15 10:45:00,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 10:45:00,609 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-15 10:45:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:00,610 INFO L225 Difference]: With dead ends: 49 [2019-02-15 10:45:00,610 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 10:45:00,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-15 10:45:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 10:45:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-15 10:45:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 10:45:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-15 10:45:00,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-15 10:45:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:00,617 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-15 10:45:00,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-15 10:45:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-15 10:45:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-15 10:45:00,618 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:00,618 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-15 10:45:00,619 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-15 10:45:00,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:00,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:00,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 10:45:00,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:00,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:00,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:00,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:00,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:00,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:00,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:00,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:00,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-15 10:45:00,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:00,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 10:45:00,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 10:45:01,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:01,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2019-02-15 10:45:01,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:01,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 10:45:01,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 10:45:01,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:45:01,256 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-15 10:45:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:01,366 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-15 10:45:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 10:45:01,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-15 10:45:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:01,367 INFO L225 Difference]: With dead ends: 52 [2019-02-15 10:45:01,367 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 10:45:01,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:45:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 10:45:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-15 10:45:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 10:45:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-15 10:45:01,373 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-15 10:45:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:01,373 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-15 10:45:01,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 10:45:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-15 10:45:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-15 10:45:01,374 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:01,374 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-15 10:45:01,375 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-15 10:45:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:01,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:01,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 10:45:01,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:01,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:01,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:01,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:01,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:01,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:02,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:02,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:02,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 10:45:02,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 10:45:02,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:02,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-15 10:45:02,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:02,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-15 10:45:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-15 10:45:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 10:45:02,946 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-15 10:45:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:03,095 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-15 10:45:03,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 10:45:03,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-15 10:45:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:03,096 INFO L225 Difference]: With dead ends: 55 [2019-02-15 10:45:03,096 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 10:45:03,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 10:45:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 10:45:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-15 10:45:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:45:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-15 10:45:03,103 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-15 10:45:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:03,104 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-15 10:45:03,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-15 10:45:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-15 10:45:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-15 10:45:03,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:03,105 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-15 10:45:03,105 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-15 10:45:03,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:03,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:03,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 10:45:03,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:03,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:03,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:03,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:03,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:03,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:03,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:03,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:03,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 10:45:03,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 10:45:04,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:04,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-15 10:45:04,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:04,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-15 10:45:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-15 10:45:04,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 10:45:04,199 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-15 10:45:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:04,268 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-15 10:45:04,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 10:45:04,269 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-15 10:45:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:04,270 INFO L225 Difference]: With dead ends: 58 [2019-02-15 10:45:04,270 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 10:45:04,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 10:45:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 10:45:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-15 10:45:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 10:45:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-15 10:45:04,276 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-15 10:45:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:04,277 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-15 10:45:04,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-15 10:45:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-15 10:45:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-15 10:45:04,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,278 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-15 10:45:04,278 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,278 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-15 10:45:04,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 10:45:05,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:05,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:05,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:05,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:05,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:05,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:05,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-15 10:45:05,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:05,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 10:45:05,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 10:45:05,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:05,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-15 10:45:05,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:05,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-15 10:45:05,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-15 10:45:05,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:05,689 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-15 10:45:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:05,957 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-15 10:45:05,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 10:45:05,958 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-15 10:45:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:05,958 INFO L225 Difference]: With dead ends: 61 [2019-02-15 10:45:05,958 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 10:45:05,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 10:45:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-15 10:45:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:45:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-15 10:45:05,965 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-15 10:45:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:05,965 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-15 10:45:05,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-15 10:45:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-15 10:45:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-15 10:45:05,966 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:05,966 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-15 10:45:05,966 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-15 10:45:05,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 10:45:06,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:06,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:06,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:06,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:06,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:06,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:06,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:06,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:06,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 10:45:06,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 10:45:07,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:07,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-15 10:45:07,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:07,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-15 10:45:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-15 10:45:07,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 10:45:07,305 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-15 10:45:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:07,545 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-15 10:45:07,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 10:45:07,546 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-15 10:45:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:07,546 INFO L225 Difference]: With dead ends: 64 [2019-02-15 10:45:07,546 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 10:45:07,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 10:45:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 10:45:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-15 10:45:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 10:45:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-15 10:45:07,553 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-15 10:45:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:07,553 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-15 10:45:07,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-15 10:45:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-15 10:45:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-15 10:45:07,554 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:07,554 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-15 10:45:07,554 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-15 10:45:07,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:07,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:07,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 10:45:08,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:08,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:08,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:08,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:08,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:08,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:08,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 10:45:08,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 10:45:08,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:08,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-15 10:45:08,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:08,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-15 10:45:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-15 10:45:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 10:45:08,856 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-15 10:45:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:08,927 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-15 10:45:08,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 10:45:08,927 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-15 10:45:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:08,928 INFO L225 Difference]: With dead ends: 67 [2019-02-15 10:45:08,928 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 10:45:08,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 10:45:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 10:45:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-15 10:45:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 10:45:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-15 10:45:08,936 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-15 10:45:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:08,936 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-15 10:45:08,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-15 10:45:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-15 10:45:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-15 10:45:08,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:08,937 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-15 10:45:08,937 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-15 10:45:08,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:08,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 10:45:09,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:09,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:09,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:09,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:09,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:09,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:09,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:09,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:09,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-15 10:45:09,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:09,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 10:45:09,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 10:45:09,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:09,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-15 10:45:09,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:09,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 10:45:09,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 10:45:09,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:09,995 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-15 10:45:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:10,078 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-15 10:45:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 10:45:10,079 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-15 10:45:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:10,080 INFO L225 Difference]: With dead ends: 70 [2019-02-15 10:45:10,080 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 10:45:10,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 10:45:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-15 10:45:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 10:45:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-15 10:45:10,086 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-15 10:45:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:10,086 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-15 10:45:10,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 10:45:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-15 10:45:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-15 10:45:10,087 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:10,087 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-15 10:45:10,088 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-15 10:45:10,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 10:45:10,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:10,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:10,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:10,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:10,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:10,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:10,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:10,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:10,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:10,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:10,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 10:45:10,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 10:45:11,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:11,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-15 10:45:11,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:11,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-15 10:45:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-15 10:45:11,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 10:45:11,117 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-15 10:45:11,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:11,199 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-15 10:45:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 10:45:11,202 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-15 10:45:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:11,203 INFO L225 Difference]: With dead ends: 73 [2019-02-15 10:45:11,203 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 10:45:11,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 10:45:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 10:45:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-15 10:45:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 10:45:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-15 10:45:11,208 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-15 10:45:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:11,209 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-15 10:45:11,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-15 10:45:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-15 10:45:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 10:45:11,210 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:11,210 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-15 10:45:11,210 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:11,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-15 10:45:11,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:11,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:11,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 10:45:11,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:11,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:11,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:11,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:11,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:11,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:11,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 10:45:11,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 10:45:12,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:12,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-15 10:45:12,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:12,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-15 10:45:12,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-15 10:45:12,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-15 10:45:12,483 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-15 10:45:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:12,571 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-15 10:45:12,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 10:45:12,572 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-15 10:45:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:12,573 INFO L225 Difference]: With dead ends: 76 [2019-02-15 10:45:12,573 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 10:45:12,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-15 10:45:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 10:45:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-15 10:45:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 10:45:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-15 10:45:12,581 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-15 10:45:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:12,582 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-15 10:45:12,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-15 10:45:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-15 10:45:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-15 10:45:12,582 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:12,583 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-15 10:45:12,583 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:12,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-15 10:45:12,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:12,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 10:45:12,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:12,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:12,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:12,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:12,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:12,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:12,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:12,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:13,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-15 10:45:13,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:13,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 10:45:13,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 10:45:14,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:14,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2019-02-15 10:45:14,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:14,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 10:45:14,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 10:45:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:45:14,283 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-15 10:45:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:14,363 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-15 10:45:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 10:45:14,363 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-15 10:45:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:14,364 INFO L225 Difference]: With dead ends: 79 [2019-02-15 10:45:14,364 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 10:45:14,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:45:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 10:45:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-15 10:45:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 10:45:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-15 10:45:14,370 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-15 10:45:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:14,370 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-15 10:45:14,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 10:45:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-15 10:45:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-15 10:45:14,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:14,371 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-15 10:45:14,371 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-15 10:45:14,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:14,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:14,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:14,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:14,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 10:45:14,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:14,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:14,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:14,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:14,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:14,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:14,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:14,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:14,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 10:45:14,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 10:45:15,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:15,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-15 10:45:15,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:15,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 10:45:15,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 10:45:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 10:45:15,873 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-15 10:45:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:15,997 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-15 10:45:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 10:45:15,998 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-15 10:45:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:15,998 INFO L225 Difference]: With dead ends: 82 [2019-02-15 10:45:15,999 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:45:15,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 10:45:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:45:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-15 10:45:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 10:45:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-15 10:45:16,004 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-15 10:45:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:16,004 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-15 10:45:16,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 10:45:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-15 10:45:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-15 10:45:16,005 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:16,005 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-15 10:45:16,005 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-15 10:45:16,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:16,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:16,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:16,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:16,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 10:45:16,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:16,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:16,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:16,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:16,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:16,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:16,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:16,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:16,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 10:45:16,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 10:45:17,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:17,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-15 10:45:17,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:17,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-15 10:45:17,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-15 10:45:17,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 10:45:17,886 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-15 10:45:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:17,979 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-15 10:45:17,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-15 10:45:17,980 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-15 10:45:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:17,981 INFO L225 Difference]: With dead ends: 85 [2019-02-15 10:45:17,981 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 10:45:17,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 10:45:17,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 10:45:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-15 10:45:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-15 10:45:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-15 10:45:17,986 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-15 10:45:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:17,987 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-15 10:45:17,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-15 10:45:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-15 10:45:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-15 10:45:17,987 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:17,987 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-15 10:45:17,987 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-15 10:45:17,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:17,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:17,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:17,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:17,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 10:45:18,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:18,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:18,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:18,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:18,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:18,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:18,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:18,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:18,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-15 10:45:18,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:18,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 10:45:18,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 10:45:19,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:19,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2019-02-15 10:45:19,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:19,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 10:45:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 10:45:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 10:45:19,496 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-15 10:45:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:19,574 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-15 10:45:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 10:45:19,575 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-15 10:45:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:19,576 INFO L225 Difference]: With dead ends: 88 [2019-02-15 10:45:19,576 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 10:45:19,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 10:45:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 10:45:19,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-15 10:45:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 10:45:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-15 10:45:19,581 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-15 10:45:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:19,581 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-15 10:45:19,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 10:45:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-15 10:45:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-15 10:45:19,582 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:19,582 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-15 10:45:19,583 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:19,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:19,583 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-15 10:45:19,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:19,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:19,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 10:45:20,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:20,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:20,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:20,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:20,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:20,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:20,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:20,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:20,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:20,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:20,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 10:45:20,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 10:45:21,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:21,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-15 10:45:21,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:21,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-15 10:45:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-15 10:45:21,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 10:45:21,185 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-15 10:45:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:21,333 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-15 10:45:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 10:45:21,334 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-15 10:45:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:21,334 INFO L225 Difference]: With dead ends: 91 [2019-02-15 10:45:21,334 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 10:45:21,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 10:45:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 10:45:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-15 10:45:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:45:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-15 10:45:21,339 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-15 10:45:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:21,339 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-15 10:45:21,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-15 10:45:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-15 10:45:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-15 10:45:21,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:21,340 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-15 10:45:21,340 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-15 10:45:21,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:21,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:21,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 10:45:21,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:21,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:21,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:21,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:21,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:21,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:21,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:21,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:21,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 10:45:21,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 10:45:23,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:23,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-15 10:45:23,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:23,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-15 10:45:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-15 10:45:23,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 10:45:23,031 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-15 10:45:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:23,172 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-15 10:45:23,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 10:45:23,173 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-15 10:45:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:23,173 INFO L225 Difference]: With dead ends: 94 [2019-02-15 10:45:23,173 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 10:45:23,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 10:45:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 10:45:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-15 10:45:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 10:45:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-15 10:45:23,178 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-15 10:45:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:23,178 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-15 10:45:23,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-15 10:45:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-15 10:45:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-15 10:45:23,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:23,179 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-15 10:45:23,179 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-15 10:45:23,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:23,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:23,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 10:45:24,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:24,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:24,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:24,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:24,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:24,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:24,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-15 10:45:24,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:24,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 10:45:24,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 10:45:25,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:25,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2019-02-15 10:45:25,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:25,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 10:45:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 10:45:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:25,412 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-15 10:45:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:25,487 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-15 10:45:25,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 10:45:25,488 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-15 10:45:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:25,488 INFO L225 Difference]: With dead ends: 97 [2019-02-15 10:45:25,488 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 10:45:25,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 10:45:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-15 10:45:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-15 10:45:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-15 10:45:25,493 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-15 10:45:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:25,493 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-15 10:45:25,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 10:45:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-15 10:45:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-15 10:45:25,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:25,494 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-15 10:45:25,494 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:25,494 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-15 10:45:25,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:25,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:25,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:25,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:25,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 10:45:25,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:25,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:25,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:25,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:25,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:25,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:25,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:25,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:26,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:26,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:26,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 10:45:26,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 10:45:27,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:27,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-15 10:45:27,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:27,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-15 10:45:27,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-15 10:45:27,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 10:45:27,084 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-15 10:45:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:27,284 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-15 10:45:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 10:45:27,284 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-15 10:45:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:27,284 INFO L225 Difference]: With dead ends: 100 [2019-02-15 10:45:27,284 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 10:45:27,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 10:45:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 10:45:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-15 10:45:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 10:45:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-15 10:45:27,289 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-15 10:45:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:27,289 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-15 10:45:27,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-15 10:45:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-15 10:45:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-15 10:45:27,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:27,290 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-15 10:45:27,290 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-15 10:45:27,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:27,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:27,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:27,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 10:45:27,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:27,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:27,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:27,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:27,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:27,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:27,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:27,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:27,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 10:45:27,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 10:45:29,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:29,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-15 10:45:29,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:29,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-15 10:45:29,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-15 10:45:29,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 10:45:29,069 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-15 10:45:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:29,208 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-15 10:45:29,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 10:45:29,209 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-15 10:45:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:29,210 INFO L225 Difference]: With dead ends: 103 [2019-02-15 10:45:29,210 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 10:45:29,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 10:45:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 10:45:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-15 10:45:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 10:45:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-15 10:45:29,214 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-15 10:45:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:29,214 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-15 10:45:29,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-15 10:45:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-15 10:45:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-15 10:45:29,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:29,215 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-15 10:45:29,215 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-15 10:45:29,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:29,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 10:45:29,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:29,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:29,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:29,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:29,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:29,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:29,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:29,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:30,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-15 10:45:30,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:30,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 10:45:30,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 10:45:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:31,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-15 10:45:31,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:31,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-15 10:45:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-15 10:45:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 10:45:31,260 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-15 10:45:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:31,418 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-15 10:45:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 10:45:31,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-15 10:45:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:31,419 INFO L225 Difference]: With dead ends: 106 [2019-02-15 10:45:31,419 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 10:45:31,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 10:45:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 10:45:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-15 10:45:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 10:45:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-15 10:45:31,424 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-15 10:45:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:31,425 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-15 10:45:31,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-15 10:45:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-15 10:45:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-15 10:45:31,425 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:31,425 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-15 10:45:31,425 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-15 10:45:31,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:31,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:31,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 10:45:32,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:32,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:32,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:32,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:32,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:32,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:32,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:32,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:32,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:32,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:32,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 10:45:32,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 10:45:33,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:33,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-15 10:45:33,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:33,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-15 10:45:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-15 10:45:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 10:45:33,703 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-15 10:45:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:33,862 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-15 10:45:33,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 10:45:33,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-15 10:45:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:33,864 INFO L225 Difference]: With dead ends: 109 [2019-02-15 10:45:33,864 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 10:45:33,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 10:45:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 10:45:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-15 10:45:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 10:45:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-15 10:45:33,868 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-15 10:45:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:33,868 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-15 10:45:33,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-15 10:45:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-15 10:45:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 10:45:33,869 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:33,869 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-15 10:45:33,870 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-15 10:45:33,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:33,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:33,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:33,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:33,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 10:45:34,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:34,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:34,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:34,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:34,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:34,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:34,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:34,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:34,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 10:45:34,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 10:45:35,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:35,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-15 10:45:35,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:35,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-15 10:45:35,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-15 10:45:35,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-15 10:45:35,908 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-15 10:45:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:36,069 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-15 10:45:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 10:45:36,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-15 10:45:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:36,070 INFO L225 Difference]: With dead ends: 112 [2019-02-15 10:45:36,070 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 10:45:36,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-15 10:45:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 10:45:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-15 10:45:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 10:45:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-15 10:45:36,075 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-15 10:45:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:36,075 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-15 10:45:36,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-15 10:45:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-15 10:45:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-15 10:45:36,075 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:36,076 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-15 10:45:36,076 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:36,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-15 10:45:36,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:36,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:36,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:36,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:36,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 10:45:36,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:36,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:36,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:36,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:36,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:36,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:37,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-15 10:45:37,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:37,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 10:45:37,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 10:45:39,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:39,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-15 10:45:39,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:39,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 10:45:39,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 10:45:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:45:39,060 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-15 10:45:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:39,199 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-15 10:45:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 10:45:39,200 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-15 10:45:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:39,201 INFO L225 Difference]: With dead ends: 115 [2019-02-15 10:45:39,201 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 10:45:39,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:45:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 10:45:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-15 10:45:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:45:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-15 10:45:39,205 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-15 10:45:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:39,205 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-15 10:45:39,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 10:45:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-15 10:45:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-15 10:45:39,206 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:39,206 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-15 10:45:39,206 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-15 10:45:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:39,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:39,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 10:45:40,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:40,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:40,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:40,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:40,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:40,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:40,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:40,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:40,116 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:40,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:40,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 10:45:40,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 10:45:41,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:41,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-15 10:45:41,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:41,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-15 10:45:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-15 10:45:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 10:45:41,859 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-15 10:45:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:42,015 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-15 10:45:42,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 10:45:42,015 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-15 10:45:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:42,016 INFO L225 Difference]: With dead ends: 118 [2019-02-15 10:45:42,016 INFO L226 Difference]: Without dead ends: 79 [2019-02-15 10:45:42,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 10:45:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-15 10:45:42,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-15 10:45:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-15 10:45:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-15 10:45:42,020 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-15 10:45:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:42,020 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-15 10:45:42,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-15 10:45:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-15 10:45:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-15 10:45:42,021 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:42,021 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-15 10:45:42,021 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:42,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-15 10:45:42,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:42,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:42,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:42,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:42,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 10:45:42,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:42,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:42,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:42,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:42,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:42,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:42,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:42,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:43,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 10:45:43,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 10:45:44,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:44,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-15 10:45:44,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:44,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-15 10:45:44,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-15 10:45:44,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 10:45:44,708 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-15 10:45:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:44,864 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-15 10:45:44,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 10:45:44,864 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-15 10:45:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:44,865 INFO L225 Difference]: With dead ends: 121 [2019-02-15 10:45:44,865 INFO L226 Difference]: Without dead ends: 81 [2019-02-15 10:45:44,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 10:45:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-15 10:45:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-15 10:45:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-15 10:45:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-15 10:45:44,870 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-15 10:45:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:44,870 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-15 10:45:44,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-15 10:45:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-15 10:45:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-15 10:45:44,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:44,871 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-15 10:45:44,871 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-15 10:45:44,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:44,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:44,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:44,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 10:45:45,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:45,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:45,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:45,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:45,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:45,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:45,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:45,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:46,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-15 10:45:46,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:46,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 10:45:46,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 10:45:47,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:47,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-15 10:45:47,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:47,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-15 10:45:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-15 10:45:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:45:47,956 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-15 10:45:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:48,124 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-15 10:45:48,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 10:45:48,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-15 10:45:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:48,125 INFO L225 Difference]: With dead ends: 124 [2019-02-15 10:45:48,125 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 10:45:48,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:45:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 10:45:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-15 10:45:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-15 10:45:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-15 10:45:48,129 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-15 10:45:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:48,129 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-15 10:45:48,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-15 10:45:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-15 10:45:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-15 10:45:48,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:48,129 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-15 10:45:48,130 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-15 10:45:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:48,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:48,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 10:45:48,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:48,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:48,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:48,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:48,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:48,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:48,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:48,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:49,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:49,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:49,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 10:45:49,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 10:45:50,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:50,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-15 10:45:50,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:50,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-15 10:45:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-15 10:45:50,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 10:45:50,837 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-15 10:45:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:50,993 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-15 10:45:50,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-15 10:45:50,994 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-15 10:45:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:50,995 INFO L225 Difference]: With dead ends: 127 [2019-02-15 10:45:50,995 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:45:50,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 10:45:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:45:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-15 10:45:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-15 10:45:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-15 10:45:51,000 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-15 10:45:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:51,000 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-15 10:45:51,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-15 10:45:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-15 10:45:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-15 10:45:51,001 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:51,001 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-15 10:45:51,001 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-15 10:45:51,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:51,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:51,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 10:45:51,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:51,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:51,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:51,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:51,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:51,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:51,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:51,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:51,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 10:45:51,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 10:45:53,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:53,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-15 10:45:53,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:53,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-15 10:45:53,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-15 10:45:53,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-15 10:45:53,984 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-15 10:45:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:54,134 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-15 10:45:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 10:45:54,134 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-15 10:45:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:54,135 INFO L225 Difference]: With dead ends: 130 [2019-02-15 10:45:54,135 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 10:45:54,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-15 10:45:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 10:45:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-15 10:45:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-15 10:45:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-15 10:45:54,141 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-15 10:45:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:54,142 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-15 10:45:54,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-15 10:45:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-15 10:45:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-15 10:45:54,142 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:54,143 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-15 10:45:54,143 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-15 10:45:54,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:54,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:54,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:54,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:54,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 10:45:54,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:54,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:54,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:54,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:54,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:54,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:54,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:54,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:55,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-15 10:45:55,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:55,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 10:45:55,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 10:45:57,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:57,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-15 10:45:57,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:57,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 10:45:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 10:45:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:45:57,655 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-15 10:45:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:57,817 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-15 10:45:57,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 10:45:57,817 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-15 10:45:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:57,818 INFO L225 Difference]: With dead ends: 133 [2019-02-15 10:45:57,818 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:45:57,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:45:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:45:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-15 10:45:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-15 10:45:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-15 10:45:57,822 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-15 10:45:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:57,822 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-15 10:45:57,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 10:45:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-15 10:45:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-15 10:45:57,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:57,823 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-15 10:45:57,823 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-15 10:45:57,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:57,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:57,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 10:45:58,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:58,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:58,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:58,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:58,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:58,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:58,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:58,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:58,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:58,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:58,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 10:45:58,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 10:46:00,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:00,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-15 10:46:00,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:00,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-15 10:46:00,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-15 10:46:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 10:46:00,946 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-15 10:46:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:01,102 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-15 10:46:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 10:46:01,102 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-15 10:46:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:01,103 INFO L225 Difference]: With dead ends: 136 [2019-02-15 10:46:01,104 INFO L226 Difference]: Without dead ends: 91 [2019-02-15 10:46:01,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 10:46:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-15 10:46:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-15 10:46:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 10:46:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-15 10:46:01,109 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-15 10:46:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:01,109 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-15 10:46:01,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-15 10:46:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-15 10:46:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-15 10:46:01,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:01,110 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-15 10:46:01,110 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-15 10:46:01,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:01,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:01,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 10:46:02,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:02,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:02,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:02,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:02,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:02,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:02,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:02,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:02,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 10:46:02,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 10:46:04,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:04,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-15 10:46:04,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:04,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-15 10:46:04,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-15 10:46:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-15 10:46:04,445 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-15 10:46:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:05,030 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-15 10:46:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-15 10:46:05,031 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-15 10:46:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:05,031 INFO L225 Difference]: With dead ends: 139 [2019-02-15 10:46:05,031 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 10:46:05,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-15 10:46:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 10:46:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-15 10:46:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 10:46:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-15 10:46:05,036 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-15 10:46:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:05,036 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-15 10:46:05,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-15 10:46:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-15 10:46:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-15 10:46:05,037 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:05,037 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-15 10:46:05,037 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-15 10:46:05,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:05,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 10:46:05,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:05,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:05,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:05,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:05,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:05,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:05,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:05,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:06,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-15 10:46:06,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:06,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 10:46:06,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 10:46:09,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:09,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2019-02-15 10:46:09,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:09,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 10:46:09,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 10:46:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:46:09,181 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-15 10:46:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:10,110 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-15 10:46:10,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 10:46:10,111 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-15 10:46:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:10,111 INFO L225 Difference]: With dead ends: 142 [2019-02-15 10:46:10,112 INFO L226 Difference]: Without dead ends: 95 [2019-02-15 10:46:10,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:46:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-15 10:46:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-15 10:46:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 10:46:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-15 10:46:10,116 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-15 10:46:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:10,117 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-15 10:46:10,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 10:46:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-15 10:46:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-15 10:46:10,117 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:10,117 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-15 10:46:10,118 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-15 10:46:10,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:10,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:10,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:10,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:10,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 10:46:11,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:11,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:11,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:11,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:11,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:11,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:11,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:11,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:11,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:11,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:11,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 10:46:11,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 10:46:14,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:14,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-15 10:46:14,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:14,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-15 10:46:14,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-15 10:46:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 10:46:14,838 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-15 10:46:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:15,024 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-15 10:46:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 10:46:15,025 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-15 10:46:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:15,026 INFO L225 Difference]: With dead ends: 145 [2019-02-15 10:46:15,026 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 10:46:15,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 10:46:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 10:46:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-15 10:46:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 10:46:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-15 10:46:15,032 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-15 10:46:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:15,032 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-15 10:46:15,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-15 10:46:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-15 10:46:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-15 10:46:15,033 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:15,033 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-15 10:46:15,033 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:15,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-15 10:46:15,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:15,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:15,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:15,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:15,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 10:46:16,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:16,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:16,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:16,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:16,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:16,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:16,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:16,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:16,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 10:46:16,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 10:46:18,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:18,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-15 10:46:18,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:18,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-15 10:46:18,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-15 10:46:18,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-15 10:46:18,707 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-15 10:46:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:18,993 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-15 10:46:18,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 10:46:18,993 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-15 10:46:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:18,994 INFO L225 Difference]: With dead ends: 148 [2019-02-15 10:46:18,994 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 10:46:18,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-15 10:46:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 10:46:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-15 10:46:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-15 10:46:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-15 10:46:18,998 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-15 10:46:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:18,998 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-15 10:46:18,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-15 10:46:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-15 10:46:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-15 10:46:18,999 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:18,999 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-15 10:46:18,999 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:18,999 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-15 10:46:18,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:19,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:19,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:19,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:19,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 10:46:20,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:20,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:20,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:20,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:20,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:20,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:20,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:20,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:21,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-15 10:46:21,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:21,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 10:46:21,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 10:46:24,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:24,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-15 10:46:24,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:24,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 10:46:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 10:46:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:46:24,975 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-15 10:46:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:25,350 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-15 10:46:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 10:46:25,350 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-15 10:46:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:25,351 INFO L225 Difference]: With dead ends: 151 [2019-02-15 10:46:25,351 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 10:46:25,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:46:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 10:46:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-15 10:46:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 10:46:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-15 10:46:25,356 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-15 10:46:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:25,356 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-15 10:46:25,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 10:46:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-15 10:46:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-15 10:46:25,357 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:25,357 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-15 10:46:25,357 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-15 10:46:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:25,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:25,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 10:46:27,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:27,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:27,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:27,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:27,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:27,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:27,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:27,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:27,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:27,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:27,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 10:46:27,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 10:46:30,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:30,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-15 10:46:30,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:30,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-15 10:46:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-15 10:46:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 10:46:30,142 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-15 10:46:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:30,349 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-15 10:46:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 10:46:30,349 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-15 10:46:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:30,350 INFO L225 Difference]: With dead ends: 154 [2019-02-15 10:46:30,351 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 10:46:30,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 10:46:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 10:46:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-15 10:46:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 10:46:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-15 10:46:30,355 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-15 10:46:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:30,355 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-15 10:46:30,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-15 10:46:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-15 10:46:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-15 10:46:30,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:30,356 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-15 10:46:30,356 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-15 10:46:30,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:30,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:30,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 10:46:32,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:32,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:32,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:32,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:32,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:32,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:32,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:32,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:32,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 10:46:32,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 10:46:35,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:35,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-15 10:46:35,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:35,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-15 10:46:35,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-15 10:46:35,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 10:46:35,460 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-15 10:46:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:35,689 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-15 10:46:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 10:46:35,689 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-15 10:46:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:35,690 INFO L225 Difference]: With dead ends: 157 [2019-02-15 10:46:35,690 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 10:46:35,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 10:46:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 10:46:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-15 10:46:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 10:46:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-15 10:46:35,695 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-15 10:46:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:35,695 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-15 10:46:35,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-15 10:46:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-15 10:46:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-15 10:46:35,696 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:35,696 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-15 10:46:35,696 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-15 10:46:35,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:35,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:35,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 10:46:36,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:36,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:36,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:36,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:36,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:36,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:36,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:36,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:37,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-15 10:46:37,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:37,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 10:46:37,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 10:46:40,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:40,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-15 10:46:40,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:40,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 10:46:40,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 10:46:40,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:40,962 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-15 10:46:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:41,301 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-15 10:46:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 10:46:41,302 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-15 10:46:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:41,303 INFO L225 Difference]: With dead ends: 160 [2019-02-15 10:46:41,303 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 10:46:41,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 10:46:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-15 10:46:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-15 10:46:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-15 10:46:41,310 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-15 10:46:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:41,310 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-15 10:46:41,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 10:46:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-15 10:46:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-15 10:46:41,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:41,311 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-15 10:46:41,311 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:41,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-15 10:46:41,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:41,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:41,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:41,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:41,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 10:46:42,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:42,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:42,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:42,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:42,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:42,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:42,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:42,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:42,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:42,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 10:46:42,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 10:46:46,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:46,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-15 10:46:46,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:46,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-15 10:46:46,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-15 10:46:46,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 10:46:46,152 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-15 10:46:46,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:46,413 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-15 10:46:46,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 10:46:46,413 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-15 10:46:46,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:46,414 INFO L225 Difference]: With dead ends: 163 [2019-02-15 10:46:46,414 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 10:46:46,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 10:46:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 10:46:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-15 10:46:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 10:46:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-15 10:46:46,419 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-15 10:46:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:46,419 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-15 10:46:46,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-15 10:46:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-15 10:46:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-15 10:46:46,420 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:46,420 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-15 10:46:46,421 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-15 10:46:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:46,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:46,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 10:46:47,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:47,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:47,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:47,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:47,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:47,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:47,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:47,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:47,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 10:46:47,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 10:46:51,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:51,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-15 10:46:51,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:51,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 10:46:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 10:46:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-15 10:46:51,232 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-15 10:46:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:51,506 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-15 10:46:51,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 10:46:51,507 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-15 10:46:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:51,508 INFO L225 Difference]: With dead ends: 166 [2019-02-15 10:46:51,508 INFO L226 Difference]: Without dead ends: 111 [2019-02-15 10:46:51,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-15 10:46:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-15 10:46:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-15 10:46:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-15 10:46:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-15 10:46:51,512 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-15 10:46:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:51,512 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-15 10:46:51,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 10:46:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-15 10:46:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-15 10:46:51,512 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:51,513 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-15 10:46:51,513 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-15 10:46:51,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:51,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:51,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-15 10:46:52,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:52,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:52,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:52,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:52,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:52,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:52,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:52,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:54,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-15 10:46:54,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:54,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:54,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:54,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:54,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:54,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-02-15 10:47:27,105 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-15 10:47:27,307 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:27,308 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-02-15 10:47:27,313 INFO L168 Benchmark]: Toolchain (without parser) took 159541.23 ms. Allocated memory was 139.5 MB in the beginning and 849.9 MB in the end (delta: 710.4 MB). Free memory was 106.1 MB in the beginning and 349.0 MB in the end (delta: -242.9 MB). Peak memory consumption was 467.5 MB. Max. memory is 7.1 GB. [2019-02-15 10:47:27,315 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:47:27,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.47 ms. Allocated memory is still 139.5 MB. Free memory was 105.9 MB in the beginning and 104.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-02-15 10:47:27,316 INFO L168 Benchmark]: Boogie Preprocessor took 24.62 ms. Allocated memory is still 139.5 MB. Free memory was 104.1 MB in the beginning and 103.2 MB in the end (delta: 936.3 kB). Peak memory consumption was 936.3 kB. Max. memory is 7.1 GB. [2019-02-15 10:47:27,317 INFO L168 Benchmark]: RCFGBuilder took 345.73 ms. Allocated memory is still 139.5 MB. Free memory was 103.0 MB in the beginning and 93.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-02-15 10:47:27,318 INFO L168 Benchmark]: TraceAbstraction took 159123.71 ms. Allocated memory was 139.5 MB in the beginning and 849.9 MB in the end (delta: 710.4 MB). Free memory was 93.6 MB in the beginning and 349.0 MB in the end (delta: -255.4 MB). Peak memory consumption was 455.0 MB. Max. memory is 7.1 GB. [2019-02-15 10:47:27,326 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.47 ms. Allocated memory is still 139.5 MB. Free memory was 105.9 MB in the beginning and 104.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.62 ms. Allocated memory is still 139.5 MB. Free memory was 104.1 MB in the beginning and 103.2 MB in the end (delta: 936.3 kB). Peak memory consumption was 936.3 kB. Max. memory is 7.1 GB. * RCFGBuilder took 345.73 ms. Allocated memory is still 139.5 MB. Free memory was 103.0 MB in the beginning and 93.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159123.71 ms. Allocated memory was 139.5 MB in the beginning and 849.9 MB in the end (delta: 710.4 MB). Free memory was 93.6 MB in the beginning and 349.0 MB in the end (delta: -255.4 MB). Peak memory consumption was 455.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...