java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:18:35,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:18:35,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:18:35,708 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:18:35,709 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:18:35,710 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:18:35,711 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:18:35,714 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:18:35,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:18:35,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:18:35,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:18:35,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:18:35,721 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:18:35,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:18:35,730 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:18:35,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:18:35,732 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:18:35,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:18:35,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:18:35,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:18:35,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:18:35,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:18:35,751 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:18:35,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:18:35,751 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:18:35,752 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:18:35,753 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:18:35,754 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:18:35,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:18:35,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:18:35,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:18:35,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:18:35,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:18:35,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:18:35,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:18:35,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:18:35,762 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-08 14:18:35,788 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:18:35,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:18:35,790 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:18:35,790 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:18:35,790 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:18:35,790 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:18:35,791 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:18:35,791 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:18:35,791 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:18:35,792 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-08 14:18:35,792 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-08 14:18:35,792 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:18:35,792 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:18:35,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:18:35,794 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:18:35,795 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:18:35,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:18:35,796 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:18:35,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:18:35,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:18:35,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:18:35,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:18:35,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:18:35,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:18:35,797 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:18:35,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:18:35,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:18:35,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:18:35,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:18:35,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:18:35,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:18:35,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:18:35,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:18:35,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:18:35,800 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:18:35,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:18:35,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:18:35,801 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:18:35,801 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:18:35,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:18:35,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:18:35,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:18:35,879 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:18:35,880 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:18:35,881 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-01-08 14:18:35,882 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-01-08 14:18:35,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:18:35,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:18:35,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:35,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:18:35,934 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:18:35,952 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,964 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:35,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:18:35,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:18:35,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:18:35,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:18:35,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:18:35,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:18:35,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:18:35,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:18:36,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:18:36,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:18:36,325 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:18:36,325 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-08 14:18:36,327 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:36 BoogieIcfgContainer [2019-01-08 14:18:36,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:18:36,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:18:36,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:18:36,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:18:36,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/2) ... [2019-01-08 14:18:36,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a12d5f2 and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:18:36, skipping insertion in model container [2019-01-08 14:18:36,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:36" (2/2) ... [2019-01-08 14:18:36,337 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-01-08 14:18:36,350 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:18:36,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 14:18:36,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 14:18:36,420 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:18:36,421 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:18:36,421 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:18:36,421 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:18:36,421 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:18:36,421 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:18:36,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:18:36,422 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:18:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-08 14:18:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:18:36,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:36,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:18:36,450 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:36,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-08 14:18:36,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:36,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:36,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:18:36,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:18:36,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:18:36,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:18:36,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:18:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:18:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:18:36,631 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-08 14:18:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:36,717 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-08 14:18:36,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:18:36,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-08 14:18:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:36,730 INFO L225 Difference]: With dead ends: 12 [2019-01-08 14:18:36,730 INFO L226 Difference]: Without dead ends: 7 [2019-01-08 14:18:36,734 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-01-08 14:18:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-08 14:18:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-08 14:18:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 14:18:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-08 14:18:36,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-08 14:18:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:36,767 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-08 14:18:36,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:18:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-08 14:18:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:18:36,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:36,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:18:36,768 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-08 14:18:36,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:36,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:36,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:18:36,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:36,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:36,890 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:18:36,893 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-08 14:18:36,990 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:18:36,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:18:41,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:18:41,735 INFO L272 AbstractInterpreter]: Visited 6 different actions 50 times. Merged at 4 different actions 28 times. Widened at 2 different actions 12 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:18:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:41,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:18:41,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:41,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:41,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:41,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:41,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:18:41,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:18:42,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:42,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-08 14:18:42,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:42,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:18:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:18:42,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 14:18:42,080 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-08 14:18:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:42,247 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-08 14:18:42,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:18:42,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-08 14:18:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:42,250 INFO L225 Difference]: With dead ends: 13 [2019-01-08 14:18:42,250 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 14:18:42,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 14:18:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 14:18:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-08 14:18:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 14:18:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-08 14:18:42,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-08 14:18:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:42,255 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-08 14:18:42,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:18:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-08 14:18:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:18:42,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:42,256 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-08 14:18:42,258 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:42,258 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-08 14:18:42,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:42,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:42,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:42,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:18:42,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:42,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:42,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:42,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:42,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:42,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:42,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:42,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:42,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:18:42,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:42,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:18:42,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:18:42,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:42,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-08 14:18:42,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:42,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:18:42,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:18:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:18:42,718 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-08 14:18:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:42,878 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-08 14:18:42,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:18:42,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-08 14:18:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:42,881 INFO L225 Difference]: With dead ends: 16 [2019-01-08 14:18:42,882 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 14:18:42,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:18:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 14:18:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-08 14:18:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-08 14:18:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-08 14:18:42,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-08 14:18:42,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:42,886 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-08 14:18:42,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:18:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-08 14:18:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:18:42,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:42,887 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-08 14:18:42,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:42,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:42,888 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-08 14:18:42,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:42,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:42,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:42,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:42,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 14:18:43,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:43,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:43,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:43,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:43,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:43,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:43,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:43,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:43,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 14:18:43,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 14:18:43,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:43,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-08 14:18:43,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:43,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:18:43,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:18:43,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:18:43,410 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-08 14:18:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:43,477 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-08 14:18:43,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:18:43,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-08 14:18:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:43,478 INFO L225 Difference]: With dead ends: 19 [2019-01-08 14:18:43,478 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 14:18:43,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:18:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 14:18:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-08 14:18:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:18:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-08 14:18:43,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-08 14:18:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:43,483 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-08 14:18:43,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:18:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-08 14:18:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-08 14:18:43,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:43,484 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-08 14:18:43,484 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-08 14:18:43,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:43,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:43,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:43,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:43,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 14:18:43,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:43,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:43,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:43,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:43,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:43,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:43,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 14:18:43,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 14:18:43,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:43,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-08 14:18:43,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:43,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:18:43,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:18:43,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:18:43,951 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-08 14:18:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:44,023 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-08 14:18:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:18:44,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-08 14:18:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:44,026 INFO L225 Difference]: With dead ends: 22 [2019-01-08 14:18:44,026 INFO L226 Difference]: Without dead ends: 15 [2019-01-08 14:18:44,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:18:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-08 14:18:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-08 14:18:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-08 14:18:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-08 14:18:44,030 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-08 14:18:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:44,031 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-08 14:18:44,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:18:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-08 14:18:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-08 14:18:44,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:44,032 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-08 14:18:44,032 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-08 14:18:44,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:44,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 14:18:44,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:44,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:44,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:44,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:44,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:44,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:44,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:44,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:44,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:18:44,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:44,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 14:18:44,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 14:18:44,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:44,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-08 14:18:44,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:44,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:18:44,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:18:44,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:18:44,762 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-08 14:18:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:44,871 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-08 14:18:44,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:18:44,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-08 14:18:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:44,872 INFO L225 Difference]: With dead ends: 25 [2019-01-08 14:18:44,872 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 14:18:44,873 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-01-08 14:18:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 14:18:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-08 14:18:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:18:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-08 14:18:44,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-08 14:18:44,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:44,877 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-08 14:18:44,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:18:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-08 14:18:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-08 14:18:44,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:44,878 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-08 14:18:44,878 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:44,878 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-08 14:18:44,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:44,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:44,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:44,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:44,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 14:18:44,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:44,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:44,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:44,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:44,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:44,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:45,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:45,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:45,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:45,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 14:18:45,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 14:18:45,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:45,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-08 14:18:45,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:45,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:18:45,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:18:45,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:18:45,277 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-08 14:18:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:45,327 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-08 14:18:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:18:45,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-08 14:18:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:45,329 INFO L225 Difference]: With dead ends: 28 [2019-01-08 14:18:45,329 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 14:18:45,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:18:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 14:18:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-08 14:18:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 14:18:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-08 14:18:45,333 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-08 14:18:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:45,334 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-08 14:18:45,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:18:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-08 14:18:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-08 14:18:45,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:45,335 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-08 14:18:45,335 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:45,335 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-08 14:18:45,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:45,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:45,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:45,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 14:18:45,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:45,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:45,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:45,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:45,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:45,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:45,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:45,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:45,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 14:18:45,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 14:18:45,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:45,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-08 14:18:45,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:45,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:18:45,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:18:45,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:18:45,770 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-08 14:18:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:45,890 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-08 14:18:45,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:18:45,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-08 14:18:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:45,893 INFO L225 Difference]: With dead ends: 31 [2019-01-08 14:18:45,893 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 14:18:45,894 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-01-08 14:18:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 14:18:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-08 14:18:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-08 14:18:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-08 14:18:45,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-08 14:18:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:45,898 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-08 14:18:45,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:18:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-08 14:18:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-08 14:18:45,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:45,899 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-08 14:18:45,900 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:45,900 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-08 14:18:45,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:45,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:45,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:45,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:45,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 14:18:46,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:46,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:46,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:46,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:46,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:46,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:46,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:46,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:46,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-08 14:18:46,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:46,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 14:18:46,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 14:18:46,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:46,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-08 14:18:46,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:46,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:18:46,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:18:46,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:18:46,470 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-08 14:18:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:46,649 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-08 14:18:46,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:18:46,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-08 14:18:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:46,651 INFO L225 Difference]: With dead ends: 34 [2019-01-08 14:18:46,651 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 14:18:46,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:18:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 14:18:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-08 14:18:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-08 14:18:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-08 14:18:46,656 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-08 14:18:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:46,656 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-08 14:18:46,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:18:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-08 14:18:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-08 14:18:46,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:46,658 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-08 14:18:46,658 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-08 14:18:46,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:46,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:46,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:46,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 14:18:46,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:46,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:46,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:46,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:46,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:46,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:46,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:46,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:46,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:46,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:46,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 14:18:46,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 14:18:47,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:47,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-08 14:18:47,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:47,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:18:47,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:18:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:18:47,313 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-08 14:18:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:47,369 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-08 14:18:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:18:47,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-08 14:18:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:47,376 INFO L225 Difference]: With dead ends: 37 [2019-01-08 14:18:47,376 INFO L226 Difference]: Without dead ends: 25 [2019-01-08 14:18:47,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:18:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-08 14:18:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-08 14:18:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-08 14:18:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-08 14:18:47,383 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-08 14:18:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:47,383 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-08 14:18:47,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:18:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-08 14:18:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-08 14:18:47,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:47,389 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-08 14:18:47,389 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-08 14:18:47,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:47,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:47,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 14:18:47,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:47,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:47,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:47,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:47,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:47,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:47,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:47,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:47,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 14:18:47,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 14:18:48,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:48,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-08 14:18:48,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:48,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:18:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:18:48,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:18:48,388 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-08 14:18:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:48,449 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-08 14:18:48,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 14:18:48,451 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-08 14:18:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:48,452 INFO L225 Difference]: With dead ends: 40 [2019-01-08 14:18:48,452 INFO L226 Difference]: Without dead ends: 27 [2019-01-08 14:18:48,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:18:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-08 14:18:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-08 14:18:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-08 14:18:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-08 14:18:48,456 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-08 14:18:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:48,456 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-08 14:18:48,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:18:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-08 14:18:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-08 14:18:48,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:48,457 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-08 14:18:48,458 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:48,458 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-08 14:18:48,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:48,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:48,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 14:18:48,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:48,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:48,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:48,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:48,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:48,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:48,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:48,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:48,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-08 14:18:48,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:48,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:48,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:18:48,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:18:48,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:18:48,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-08 14:18:49,224 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-08 14:18:49,280 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-01-08 14:18:49,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-08 14:18:49,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:18:49,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-01-08 14:18:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 14:18:49,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 14:18:50,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:50,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2019-01-08 14:18:50,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:50,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-08 14:18:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-08 14:18:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 14:18:50,085 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-01-08 14:18:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:52,337 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-08 14:18:52,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-08 14:18:52,339 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-01-08 14:18:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:52,339 INFO L225 Difference]: With dead ends: 43 [2019-01-08 14:18:52,340 INFO L226 Difference]: Without dead ends: 29 [2019-01-08 14:18:52,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2019-01-08 14:18:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-08 14:18:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-08 14:18:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-08 14:18:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-08 14:18:52,346 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-08 14:18:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:52,346 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-08 14:18:52,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-08 14:18:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-08 14:18:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-08 14:18:52,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:52,347 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-08 14:18:52,347 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-08 14:18:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:52,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:52,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 14:18:52,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:52,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:52,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:52,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:52,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:52,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:52,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:52,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:52,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:52,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:52,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 14:18:52,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 14:18:52,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:52,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-08 14:18:52,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:52,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-08 14:18:52,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-08 14:18:52,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 14:18:52,842 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-08 14:18:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:52,955 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-08 14:18:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 14:18:52,955 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-08 14:18:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:52,957 INFO L225 Difference]: With dead ends: 46 [2019-01-08 14:18:52,957 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 14:18:52,958 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-01-08 14:18:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 14:18:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-08 14:18:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 14:18:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-08 14:18:52,964 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-08 14:18:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:52,964 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-08 14:18:52,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-08 14:18:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-08 14:18:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-08 14:18:52,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:52,965 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-08 14:18:52,965 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:52,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-08 14:18:52,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:52,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:52,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:52,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 14:18:53,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:53,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:53,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:53,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:53,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:53,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:53,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:53,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:53,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 14:18:53,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 14:18:53,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:53,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-08 14:18:53,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:53,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-08 14:18:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-08 14:18:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 14:18:53,738 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-08 14:18:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:53,830 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-08 14:18:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 14:18:53,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-08 14:18:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:53,831 INFO L225 Difference]: With dead ends: 49 [2019-01-08 14:18:53,831 INFO L226 Difference]: Without dead ends: 33 [2019-01-08 14:18:53,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 14:18:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-08 14:18:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-08 14:18:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 14:18:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-08 14:18:53,841 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-08 14:18:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:53,841 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-08 14:18:53,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-08 14:18:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-08 14:18:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-08 14:18:53,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:53,842 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-08 14:18:53,842 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:53,843 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-08 14:18:53,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:53,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:53,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:53,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:53,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 14:18:54,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:54,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:54,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:54,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:54,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:54,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:54,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:54,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:54,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-08 14:18:54,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:54,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 14:18:54,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 14:18:54,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:54,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2019-01-08 14:18:54,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:54,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 14:18:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 14:18:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-08 14:18:54,510 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-08 14:18:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:54,624 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-08 14:18:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-08 14:18:54,625 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-08 14:18:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:54,626 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:18:54,626 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 14:18:54,627 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-01-08 14:18:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 14:18:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-08 14:18:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 14:18:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-08 14:18:54,633 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-08 14:18:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:54,633 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-08 14:18:54,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 14:18:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-08 14:18:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-08 14:18:54,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:54,634 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-08 14:18:54,635 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:54,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-08 14:18:54,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:54,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:54,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:54,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:54,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 14:18:55,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:55,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:55,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:55,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:55,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:55,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:55,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:55,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:55,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:55,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:55,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 14:18:55,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 14:18:56,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:56,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-08 14:18:56,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:56,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-08 14:18:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-08 14:18:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 14:18:56,356 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-08 14:18:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:56,442 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-08 14:18:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 14:18:56,442 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-08 14:18:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:56,443 INFO L225 Difference]: With dead ends: 55 [2019-01-08 14:18:56,443 INFO L226 Difference]: Without dead ends: 37 [2019-01-08 14:18:56,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 14:18:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-08 14:18:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-08 14:18:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 14:18:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-08 14:18:56,449 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-08 14:18:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:56,449 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-08 14:18:56,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-08 14:18:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-08 14:18:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-08 14:18:56,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:56,450 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-08 14:18:56,451 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:56,451 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-08 14:18:56,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:56,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:56,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 14:18:56,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:56,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:56,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:56,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:56,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:56,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:56,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:56,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:56,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 14:18:56,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 14:18:57,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:57,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-08 14:18:57,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:57,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-08 14:18:57,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-08 14:18:57,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 14:18:57,436 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-08 14:18:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:57,504 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-08 14:18:57,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 14:18:57,504 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-08 14:18:57,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:57,505 INFO L225 Difference]: With dead ends: 58 [2019-01-08 14:18:57,505 INFO L226 Difference]: Without dead ends: 39 [2019-01-08 14:18:57,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 14:18:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-08 14:18:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-08 14:18:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:18:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-08 14:18:57,512 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-08 14:18:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:57,513 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-08 14:18:57,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-08 14:18:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-08 14:18:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-08 14:18:57,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:57,514 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-08 14:18:57,514 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:57,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:57,514 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-08 14:18:57,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:57,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:57,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:57,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:57,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 14:18:58,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:58,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:58,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:58,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:58,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:58,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:58,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:58,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:58,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-08 14:18:58,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:58,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 14:18:58,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 14:18:59,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:59,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-08 14:18:59,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:59,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-08 14:18:59,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-08 14:18:59,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 14:18:59,446 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-08 14:18:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:59,525 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-08 14:18:59,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 14:18:59,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-08 14:18:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:59,526 INFO L225 Difference]: With dead ends: 61 [2019-01-08 14:18:59,526 INFO L226 Difference]: Without dead ends: 41 [2019-01-08 14:18:59,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 14:18:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-08 14:18:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-08 14:18:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:18:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-08 14:18:59,533 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-08 14:18:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:59,534 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-08 14:18:59,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-08 14:18:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-08 14:18:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-08 14:18:59,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:59,535 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-08 14:18:59,535 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-08 14:18:59,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:59,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:59,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 14:18:59,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:59,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:59,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:59,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:59,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:59,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:59,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:59,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:59,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:59,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:59,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 14:18:59,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 14:19:00,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:00,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-08 14:19:00,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:00,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-08 14:19:00,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-08 14:19:00,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 14:19:00,418 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-08 14:19:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:00,773 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-08 14:19:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-08 14:19:00,773 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-08 14:19:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:00,774 INFO L225 Difference]: With dead ends: 64 [2019-01-08 14:19:00,774 INFO L226 Difference]: Without dead ends: 43 [2019-01-08 14:19:00,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 14:19:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-08 14:19:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-08 14:19:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-08 14:19:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-08 14:19:00,780 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-08 14:19:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:00,780 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-08 14:19:00,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-08 14:19:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-08 14:19:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-08 14:19:00,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:00,781 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-08 14:19:00,781 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-08 14:19:00,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:00,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:00,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:00,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:00,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 14:19:01,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:01,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:01,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:01,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:01,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:01,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:01,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:01,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:01,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 14:19:01,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 14:19:01,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:01,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-08 14:19:01,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:01,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-08 14:19:01,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-08 14:19:01,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 14:19:01,913 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-08 14:19:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:02,011 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-08 14:19:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 14:19:02,011 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-08 14:19:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:02,012 INFO L225 Difference]: With dead ends: 67 [2019-01-08 14:19:02,012 INFO L226 Difference]: Without dead ends: 45 [2019-01-08 14:19:02,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 14:19:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-08 14:19:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-08 14:19:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 14:19:02,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-08 14:19:02,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-08 14:19:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:02,020 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-08 14:19:02,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-08 14:19:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-08 14:19:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-08 14:19:02,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:02,021 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-08 14:19:02,021 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-08 14:19:02,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:02,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:02,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:02,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:02,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 14:19:02,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:02,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:02,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:02,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:02,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:02,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:02,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:02,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:02,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-08 14:19:02,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:02,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 14:19:02,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 14:19:03,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:03,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-08 14:19:03,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:03,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 14:19:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 14:19:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 14:19:03,061 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-08 14:19:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:03,173 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-08 14:19:03,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-08 14:19:03,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-08 14:19:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:03,174 INFO L225 Difference]: With dead ends: 70 [2019-01-08 14:19:03,175 INFO L226 Difference]: Without dead ends: 47 [2019-01-08 14:19:03,176 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-01-08 14:19:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-08 14:19:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-08 14:19:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:19:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-08 14:19:03,181 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-08 14:19:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:03,182 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-08 14:19:03,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 14:19:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-08 14:19:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-08 14:19:03,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:03,183 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-08 14:19:03,183 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-08 14:19:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:03,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:03,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 14:19:03,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:03,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:03,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:03,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:03,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:03,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:03,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:03,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:03,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:03,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:03,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 14:19:03,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 14:19:04,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:04,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-08 14:19:04,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:04,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-08 14:19:04,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-08 14:19:04,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 14:19:04,236 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-08 14:19:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:04,322 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-08 14:19:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-08 14:19:04,325 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-08 14:19:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:04,326 INFO L225 Difference]: With dead ends: 73 [2019-01-08 14:19:04,326 INFO L226 Difference]: Without dead ends: 49 [2019-01-08 14:19:04,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 14:19:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-08 14:19:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-08 14:19:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-08 14:19:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-08 14:19:04,332 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-08 14:19:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:04,332 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-08 14:19:04,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-08 14:19:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-08 14:19:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-08 14:19:04,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:04,333 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-08 14:19:04,333 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-08 14:19:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:04,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:04,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 14:19:04,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:04,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:04,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:04,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:04,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:04,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:04,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:04,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:04,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 14:19:04,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 14:19:06,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:06,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-08 14:19:06,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:06,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-08 14:19:06,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-08 14:19:06,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 14:19:06,744 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-08 14:19:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:06,861 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-08 14:19:06,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-08 14:19:06,862 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-08 14:19:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:06,862 INFO L225 Difference]: With dead ends: 76 [2019-01-08 14:19:06,862 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 14:19:06,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 14:19:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 14:19:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-08 14:19:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:19:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-08 14:19:06,870 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-08 14:19:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:06,870 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-08 14:19:06,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-08 14:19:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-08 14:19:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-08 14:19:06,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:06,871 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-08 14:19:06,871 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-08 14:19:06,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:06,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:06,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 14:19:07,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:07,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:07,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:07,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:07,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:07,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:07,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:07,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-08 14:19:07,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:07,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 14:19:07,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 14:19:08,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:08,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2019-01-08 14:19:08,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:08,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 14:19:08,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 14:19:08,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 14:19:08,345 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-08 14:19:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:08,425 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-08 14:19:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 14:19:08,425 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-08 14:19:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:08,426 INFO L225 Difference]: With dead ends: 79 [2019-01-08 14:19:08,426 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 14:19:08,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 14:19:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 14:19:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-08 14:19:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 14:19:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-08 14:19:08,433 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-08 14:19:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:08,433 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-08 14:19:08,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 14:19:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-08 14:19:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-08 14:19:08,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:08,433 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-08 14:19:08,434 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-08 14:19:08,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:08,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:08,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:08,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:08,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 14:19:08,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:08,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:08,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:08,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:08,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:08,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:08,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:08,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:08,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:08,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:08,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 14:19:08,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 14:19:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-08 14:19:09,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:09,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-08 14:19:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-08 14:19:09,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 14:19:09,729 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-08 14:19:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:09,842 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-08 14:19:09,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 14:19:09,843 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-08 14:19:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:09,844 INFO L225 Difference]: With dead ends: 82 [2019-01-08 14:19:09,844 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:19:09,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 14:19:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:19:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-08 14:19:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 14:19:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-08 14:19:09,850 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-08 14:19:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:09,851 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-08 14:19:09,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-08 14:19:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-08 14:19:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-08 14:19:09,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:09,852 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-08 14:19:09,852 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-08 14:19:09,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:09,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:09,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:09,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:09,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 14:19:10,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:10,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:10,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:10,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:10,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:10,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:10,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:10,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:10,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 14:19:10,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 14:19:11,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:11,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-08 14:19:11,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:11,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-08 14:19:11,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-08 14:19:11,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 14:19:11,278 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-08 14:19:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:11,403 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-08 14:19:11,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-08 14:19:11,404 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-08 14:19:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:11,404 INFO L225 Difference]: With dead ends: 85 [2019-01-08 14:19:11,404 INFO L226 Difference]: Without dead ends: 57 [2019-01-08 14:19:11,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 14:19:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-08 14:19:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-08 14:19:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-08 14:19:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-08 14:19:11,410 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-08 14:19:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:11,410 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-08 14:19:11,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-08 14:19:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-08 14:19:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-08 14:19:11,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:11,410 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-08 14:19:11,411 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-08 14:19:11,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:11,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:11,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:11,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:11,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 14:19:11,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:11,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:11,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:11,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:11,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:11,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:11,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:11,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:12,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-08 14:19:12,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:12,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 14:19:12,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 14:19:13,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:13,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2019-01-08 14:19:13,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:13,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 14:19:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 14:19:13,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 14:19:13,041 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-08 14:19:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:13,136 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-08 14:19:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-08 14:19:13,138 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-08 14:19:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:13,139 INFO L225 Difference]: With dead ends: 88 [2019-01-08 14:19:13,139 INFO L226 Difference]: Without dead ends: 59 [2019-01-08 14:19:13,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 14:19:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-08 14:19:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-08 14:19:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 14:19:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-08 14:19:13,143 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-08 14:19:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:13,144 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-08 14:19:13,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 14:19:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-08 14:19:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-08 14:19:13,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:13,144 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-08 14:19:13,145 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-08 14:19:13,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:13,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:13,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 14:19:13,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:13,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:13,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:13,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:13,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:13,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:13,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:13,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:13,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:13,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:13,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 14:19:13,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 14:19:14,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:14,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-08 14:19:14,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:14,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-08 14:19:14,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-08 14:19:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 14:19:14,677 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-08 14:19:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:14,801 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-08 14:19:14,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 14:19:14,802 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-08 14:19:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:14,803 INFO L225 Difference]: With dead ends: 91 [2019-01-08 14:19:14,803 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 14:19:14,804 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-01-08 14:19:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 14:19:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-08 14:19:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:19:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-08 14:19:14,808 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-08 14:19:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:14,809 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-08 14:19:14,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-08 14:19:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-08 14:19:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-08 14:19:14,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:14,810 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-08 14:19:14,810 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-08 14:19:14,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:14,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:14,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:14,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 14:19:15,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:15,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:15,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:15,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:15,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:15,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:15,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:15,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:15,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 14:19:15,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 14:19:17,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:17,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-08 14:19:17,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:17,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-08 14:19:17,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-08 14:19:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 14:19:17,147 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-08 14:19:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:17,299 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-08 14:19:17,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 14:19:17,300 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-08 14:19:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:17,301 INFO L225 Difference]: With dead ends: 94 [2019-01-08 14:19:17,301 INFO L226 Difference]: Without dead ends: 63 [2019-01-08 14:19:17,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 14:19:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-08 14:19:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-08 14:19:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 14:19:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-08 14:19:17,306 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-08 14:19:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:17,306 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-08 14:19:17,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-08 14:19:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-08 14:19:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-08 14:19:17,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:17,307 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-08 14:19:17,307 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:17,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-08 14:19:17,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:17,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:17,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:17,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:17,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 14:19:18,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:18,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:18,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:18,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:18,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:18,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:18,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:18,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:18,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-08 14:19:18,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:18,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 14:19:18,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 14:19:19,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:19,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2019-01-08 14:19:19,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:19,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 14:19:19,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 14:19:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 14:19:19,524 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-08 14:19:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:19,597 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-08 14:19:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 14:19:19,598 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-08 14:19:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:19,598 INFO L225 Difference]: With dead ends: 97 [2019-01-08 14:19:19,598 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 14:19:19,600 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-01-08 14:19:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 14:19:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-08 14:19:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-08 14:19:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-08 14:19:19,603 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-08 14:19:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:19,603 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-08 14:19:19,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 14:19:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-08 14:19:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-08 14:19:19,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:19,604 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-08 14:19:19,604 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:19,604 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-08 14:19:19,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:19,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:19,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:19,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:19,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 14:19:20,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:20,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:20,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:20,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:20,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:20,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:20,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:20,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:20,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:20,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 14:19:20,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 14:19:21,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:21,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-08 14:19:21,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:21,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-08 14:19:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-08 14:19:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 14:19:21,624 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-08 14:19:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:21,823 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-08 14:19:21,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-08 14:19:21,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-08 14:19:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:21,824 INFO L225 Difference]: With dead ends: 100 [2019-01-08 14:19:21,824 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:19:21,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 14:19:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:19:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-08 14:19:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-08 14:19:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-08 14:19:21,829 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-08 14:19:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:21,829 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-08 14:19:21,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-08 14:19:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-08 14:19:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-08 14:19:21,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:21,830 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-08 14:19:21,830 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:21,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-08 14:19:21,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:21,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:21,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 14:19:22,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:22,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:22,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:22,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:22,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:22,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:22,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:22,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:22,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 14:19:22,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 14:19:23,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:23,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-08 14:19:23,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:23,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-08 14:19:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-08 14:19:23,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 14:19:23,604 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-08 14:19:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:23,755 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-08 14:19:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 14:19:23,755 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-08 14:19:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:23,756 INFO L225 Difference]: With dead ends: 103 [2019-01-08 14:19:23,756 INFO L226 Difference]: Without dead ends: 69 [2019-01-08 14:19:23,757 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-01-08 14:19:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-08 14:19:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-08 14:19:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-08 14:19:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-08 14:19:23,762 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-08 14:19:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:23,762 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-08 14:19:23,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-08 14:19:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-08 14:19:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-08 14:19:23,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:23,763 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-08 14:19:23,763 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:23,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-08 14:19:23,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:23,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:23,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:23,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:23,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 14:19:24,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:24,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:24,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:24,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:24,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:24,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:24,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:24,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:24,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-08 14:19:24,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:24,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 14:19:24,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 14:19:25,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:25,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-08 14:19:25,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:25,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-08 14:19:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-08 14:19:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 14:19:25,896 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-08 14:19:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:26,093 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-08 14:19:26,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 14:19:26,093 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-08 14:19:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:26,094 INFO L225 Difference]: With dead ends: 106 [2019-01-08 14:19:26,094 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 14:19:26,096 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-01-08 14:19:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 14:19:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-08 14:19:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 14:19:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-08 14:19:26,099 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-08 14:19:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:26,100 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-08 14:19:26,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-08 14:19:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-08 14:19:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-08 14:19:26,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:26,101 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-08 14:19:26,101 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-08 14:19:26,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:26,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:26,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 14:19:27,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:27,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:27,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:27,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:27,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:27,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:27,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:27,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:27,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:27,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:27,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 14:19:27,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 14:19:28,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:28,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-08 14:19:28,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:28,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-08 14:19:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-08 14:19:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 14:19:28,861 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-08 14:19:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:29,026 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-08 14:19:29,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 14:19:29,026 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-08 14:19:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:29,027 INFO L225 Difference]: With dead ends: 109 [2019-01-08 14:19:29,027 INFO L226 Difference]: Without dead ends: 73 [2019-01-08 14:19:29,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 14:19:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-08 14:19:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-08 14:19:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 14:19:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-08 14:19:29,031 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-08 14:19:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:29,031 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-08 14:19:29,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-08 14:19:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-08 14:19:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-08 14:19:29,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:29,032 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-08 14:19:29,033 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:29,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-08 14:19:29,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:29,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:29,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 14:19:29,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:29,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:29,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:29,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:29,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:29,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:29,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:29,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:29,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 14:19:29,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 14:19:31,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:31,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-08 14:19:31,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:31,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-08 14:19:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-08 14:19:31,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-08 14:19:31,016 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-08 14:19:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:31,202 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-08 14:19:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 14:19:31,203 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-08 14:19:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:31,204 INFO L225 Difference]: With dead ends: 112 [2019-01-08 14:19:31,204 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 14:19:31,205 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-01-08 14:19:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 14:19:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-08 14:19:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 14:19:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-08 14:19:31,209 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-08 14:19:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:31,210 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-08 14:19:31,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-08 14:19:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-08 14:19:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-08 14:19:31,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:31,211 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-08 14:19:31,211 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:31,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:31,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-08 14:19:31,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:31,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:31,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:31,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:31,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 14:19:32,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:32,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:32,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:32,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:32,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:32,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:32,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:32,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:32,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-08 14:19:32,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:32,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 14:19:32,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 14:19:34,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:34,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-08 14:19:34,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:34,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 14:19:34,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 14:19:34,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 14:19:34,237 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-08 14:19:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:34,378 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-08 14:19:34,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-08 14:19:34,379 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-08 14:19:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:34,380 INFO L225 Difference]: With dead ends: 115 [2019-01-08 14:19:34,380 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 14:19:34,380 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-01-08 14:19:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 14:19:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-08 14:19:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:19:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-08 14:19:34,383 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-08 14:19:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:34,384 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-08 14:19:34,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 14:19:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-08 14:19:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-08 14:19:34,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:34,384 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-08 14:19:34,384 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-08 14:19:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:34,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:34,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 14:19:35,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:35,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:35,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:35,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:35,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:35,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:35,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:35,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:35,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:35,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:35,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 14:19:35,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 14:19:37,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:37,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-08 14:19:37,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:37,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-08 14:19:37,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-08 14:19:37,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 14:19:37,473 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-08 14:19:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:37,637 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-08 14:19:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 14:19:37,638 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-08 14:19:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:37,638 INFO L225 Difference]: With dead ends: 118 [2019-01-08 14:19:37,638 INFO L226 Difference]: Without dead ends: 79 [2019-01-08 14:19:37,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 14:19:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-08 14:19:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-08 14:19:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-08 14:19:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-08 14:19:37,643 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-08 14:19:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:37,643 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-08 14:19:37,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-08 14:19:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-08 14:19:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-08 14:19:37,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:37,644 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-08 14:19:37,644 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:37,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-08 14:19:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:37,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:37,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 14:19:38,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:38,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:38,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:38,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:38,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:38,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:38,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:38,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:38,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 14:19:38,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 14:19:40,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:40,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-08 14:19:40,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:40,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-08 14:19:40,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-08 14:19:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 14:19:40,116 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-08 14:19:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:40,250 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-08 14:19:40,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 14:19:40,250 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-08 14:19:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:40,251 INFO L225 Difference]: With dead ends: 121 [2019-01-08 14:19:40,251 INFO L226 Difference]: Without dead ends: 81 [2019-01-08 14:19:40,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 14:19:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-08 14:19:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-08 14:19:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-08 14:19:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-08 14:19:40,257 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-08 14:19:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:40,257 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-08 14:19:40,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-08 14:19:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-08 14:19:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-08 14:19:40,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:40,258 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-08 14:19:40,258 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-08 14:19:40,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:40,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:40,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:40,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:40,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 14:19:41,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:41,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:41,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:41,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:41,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:41,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:41,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:41,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:41,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-08 14:19:41,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:41,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 14:19:41,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 14:19:43,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:43,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-08 14:19:43,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:43,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-08 14:19:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-08 14:19:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 14:19:43,804 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-08 14:19:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:43,960 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-08 14:19:43,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-08 14:19:43,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-08 14:19:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:43,961 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:19:43,961 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 14:19:43,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 14:19:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 14:19:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-08 14:19:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-08 14:19:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-08 14:19:43,965 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-08 14:19:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:43,965 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-08 14:19:43,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-08 14:19:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-08 14:19:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-08 14:19:43,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:43,966 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-08 14:19:43,966 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-08 14:19:43,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:43,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:43,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 14:19:44,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:44,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:44,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:44,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:44,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:44,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:44,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:44,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:44,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:44,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:44,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 14:19:44,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 14:19:46,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:46,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-08 14:19:46,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:46,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-08 14:19:46,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-08 14:19:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 14:19:46,615 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-08 14:19:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:46,788 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-08 14:19:46,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-08 14:19:46,788 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-08 14:19:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:46,789 INFO L225 Difference]: With dead ends: 127 [2019-01-08 14:19:46,789 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 14:19:46,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 14:19:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 14:19:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-08 14:19:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-08 14:19:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-08 14:19:46,793 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-08 14:19:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:46,793 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-08 14:19:46,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-08 14:19:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-08 14:19:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-08 14:19:46,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:46,794 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-08 14:19:46,794 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-08 14:19:46,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:46,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:46,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:46,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:46,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 14:19:48,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:48,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:48,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:48,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:48,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:48,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:48,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:48,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:48,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 14:19:48,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 14:19:50,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:50,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-08 14:19:50,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:50,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-08 14:19:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-08 14:19:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 14:19:50,416 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-08 14:19:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:50,575 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-08 14:19:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-08 14:19:50,575 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-08 14:19:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:50,576 INFO L225 Difference]: With dead ends: 130 [2019-01-08 14:19:50,576 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 14:19:50,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 14:19:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 14:19:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-08 14:19:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-08 14:19:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-08 14:19:50,581 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-08 14:19:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:50,581 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-08 14:19:50,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-08 14:19:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-08 14:19:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-08 14:19:50,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:50,582 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-08 14:19:50,582 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:50,583 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-08 14:19:50,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:50,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:50,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 14:19:51,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:51,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:51,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:51,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:51,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:51,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:51,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:51,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:52,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-08 14:19:52,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:52,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 14:19:52,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 14:19:54,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:54,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-08 14:19:54,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:54,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 14:19:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 14:19:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 14:19:54,617 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-08 14:19:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:54,766 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-08 14:19:54,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 14:19:54,766 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-08 14:19:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:54,767 INFO L225 Difference]: With dead ends: 133 [2019-01-08 14:19:54,767 INFO L226 Difference]: Without dead ends: 89 [2019-01-08 14:19:54,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 14:19:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-08 14:19:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-08 14:19:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-08 14:19:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-08 14:19:54,772 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-08 14:19:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:54,772 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-08 14:19:54,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 14:19:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-08 14:19:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-08 14:19:54,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:54,773 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-08 14:19:54,773 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-08 14:19:54,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:54,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:54,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 14:19:55,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:55,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:55,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:55,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:55,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:55,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:55,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:55,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:55,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:55,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:55,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 14:19:55,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 14:19:58,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:58,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-08 14:19:58,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:58,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-08 14:19:58,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-08 14:19:58,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 14:19:58,311 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-08 14:19:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:58,465 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-08 14:19:58,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-08 14:19:58,465 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-08 14:19:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:58,466 INFO L225 Difference]: With dead ends: 136 [2019-01-08 14:19:58,466 INFO L226 Difference]: Without dead ends: 91 [2019-01-08 14:19:58,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 14:19:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-08 14:19:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-08 14:19:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-08 14:19:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-08 14:19:58,472 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-08 14:19:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:58,472 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-08 14:19:58,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-08 14:19:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-08 14:19:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-08 14:19:58,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:58,473 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-08 14:19:58,474 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-08 14:19:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:58,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:58,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 14:19:59,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:59,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:59,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:59,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:59,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:59,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:59,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:59,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:59,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 14:19:59,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 14:20:01,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:01,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-08 14:20:01,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:01,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-08 14:20:01,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-08 14:20:01,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 14:20:01,918 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-08 14:20:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:02,426 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-08 14:20:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-08 14:20:02,426 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-08 14:20:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:02,427 INFO L225 Difference]: With dead ends: 139 [2019-01-08 14:20:02,427 INFO L226 Difference]: Without dead ends: 93 [2019-01-08 14:20:02,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 14:20:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-08 14:20:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-08 14:20:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-08 14:20:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-08 14:20:02,432 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-08 14:20:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:02,432 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-08 14:20:02,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-08 14:20:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-08 14:20:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-08 14:20:02,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:02,432 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-08 14:20:02,433 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-08 14:20:02,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:02,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:02,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 14:20:03,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:03,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:03,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:03,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:03,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:03,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:03,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:03,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:04,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-08 14:20:04,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:04,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 14:20:04,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 14:20:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:06,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2019-01-08 14:20:06,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:06,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 14:20:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 14:20:06,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 14:20:06,708 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-08 14:20:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:07,600 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-08 14:20:07,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 14:20:07,600 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-08 14:20:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:07,601 INFO L225 Difference]: With dead ends: 142 [2019-01-08 14:20:07,601 INFO L226 Difference]: Without dead ends: 95 [2019-01-08 14:20:07,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 14:20:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-08 14:20:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-08 14:20:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 14:20:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-08 14:20:07,606 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-08 14:20:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:07,607 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-08 14:20:07,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 14:20:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-08 14:20:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-08 14:20:07,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:07,607 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-08 14:20:07,607 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-08 14:20:07,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:07,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:07,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:07,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:07,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 14:20:09,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:09,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:09,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:09,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:09,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:09,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:09,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:09,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:09,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:09,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:09,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 14:20:09,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 14:20:12,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-08 14:20:12,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:12,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-08 14:20:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-08 14:20:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 14:20:12,626 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-08 14:20:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:12,833 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-08 14:20:12,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 14:20:12,833 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-08 14:20:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:12,834 INFO L225 Difference]: With dead ends: 145 [2019-01-08 14:20:12,834 INFO L226 Difference]: Without dead ends: 97 [2019-01-08 14:20:12,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 14:20:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-08 14:20:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-08 14:20:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 14:20:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-08 14:20:12,838 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-08 14:20:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:12,838 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-08 14:20:12,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-08 14:20:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-08 14:20:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-08 14:20:12,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:12,838 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-08 14:20:12,839 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-08 14:20:12,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:12,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:12,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:12,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 14:20:14,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:14,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:14,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:14,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:14,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:14,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:14,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:14,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:14,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 14:20:14,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 14:20:16,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:16,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-08 14:20:16,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:16,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-08 14:20:16,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-08 14:20:16,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 14:20:16,750 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-08 14:20:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:17,040 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-08 14:20:17,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-08 14:20:17,040 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-08 14:20:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:17,041 INFO L225 Difference]: With dead ends: 148 [2019-01-08 14:20:17,041 INFO L226 Difference]: Without dead ends: 99 [2019-01-08 14:20:17,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 14:20:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-08 14:20:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-08 14:20:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-08 14:20:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-08 14:20:17,045 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-08 14:20:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:17,045 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-08 14:20:17,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-08 14:20:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-08 14:20:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-08 14:20:17,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:17,046 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-08 14:20:17,046 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:17,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:17,046 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-08 14:20:17,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:17,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:17,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 14:20:18,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:18,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:18,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:18,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:18,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:18,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:18,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:18,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:20,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-08 14:20:20,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:20,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 14:20:20,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 14:20:22,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:22,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-08 14:20:22,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:22,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 14:20:22,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 14:20:22,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 14:20:22,892 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-08 14:20:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:23,374 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-08 14:20:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 14:20:23,374 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-08 14:20:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:23,375 INFO L225 Difference]: With dead ends: 151 [2019-01-08 14:20:23,375 INFO L226 Difference]: Without dead ends: 101 [2019-01-08 14:20:23,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 14:20:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-08 14:20:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-08 14:20:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-08 14:20:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-08 14:20:23,381 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-08 14:20:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:23,381 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-08 14:20:23,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 14:20:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-08 14:20:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-08 14:20:23,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:23,382 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-08 14:20:23,382 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-08 14:20:23,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:23,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:23,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 14:20:24,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:24,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:24,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:24,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:24,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:24,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:24,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:24,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:24,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:24,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:24,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 14:20:24,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 14:20:27,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:27,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-08 14:20:27,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:27,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-08 14:20:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-08 14:20:27,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 14:20:27,184 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-08 14:20:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:27,481 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-08 14:20:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-08 14:20:27,481 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-08 14:20:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:27,482 INFO L225 Difference]: With dead ends: 154 [2019-01-08 14:20:27,482 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 14:20:27,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 14:20:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 14:20:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-08 14:20:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 14:20:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-08 14:20:27,488 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-08 14:20:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:27,488 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-08 14:20:27,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-08 14:20:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-08 14:20:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-08 14:20:27,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:27,489 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-08 14:20:27,489 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-08 14:20:27,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:27,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:27,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:27,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:27,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 14:20:29,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:29,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:29,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:29,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:29,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:29,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:29,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:29,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:29,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 14:20:29,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 14:20:32,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:32,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-08 14:20:32,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:32,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-08 14:20:32,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-08 14:20:32,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 14:20:32,174 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-08 14:20:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:32,423 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-08 14:20:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 14:20:32,423 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-08 14:20:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:32,424 INFO L225 Difference]: With dead ends: 157 [2019-01-08 14:20:32,424 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 14:20:32,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 14:20:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 14:20:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-08 14:20:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-08 14:20:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-08 14:20:32,429 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-08 14:20:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:32,429 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-08 14:20:32,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-08 14:20:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-08 14:20:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-08 14:20:32,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:32,430 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-08 14:20:32,430 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:32,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-08 14:20:32,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:32,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:32,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:32,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:32,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 14:20:33,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:33,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:33,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:33,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:33,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:33,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:33,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:33,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:35,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-08 14:20:35,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:35,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 14:20:35,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 14:20:38,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:38,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-08 14:20:38,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:38,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 14:20:38,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 14:20:38,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 14:20:38,027 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-08 14:20:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:38,377 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-08 14:20:38,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-08 14:20:38,377 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-08 14:20:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:38,378 INFO L225 Difference]: With dead ends: 160 [2019-01-08 14:20:38,378 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 14:20:38,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 14:20:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 14:20:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-08 14:20:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-08 14:20:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-08 14:20:38,383 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-08 14:20:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:38,384 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-08 14:20:38,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 14:20:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-08 14:20:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-08 14:20:38,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:38,385 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-08 14:20:38,385 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-08 14:20:38,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:38,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:38,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:38,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:38,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 14:20:39,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:39,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:39,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:39,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:39,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:39,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:39,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:39,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:39,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:39,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:40,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 14:20:40,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 14:20:43,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:43,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-08 14:20:43,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:43,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-08 14:20:43,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-08 14:20:43,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 14:20:43,162 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-08 14:20:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:43,455 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-08 14:20:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 14:20:43,456 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-08 14:20:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:43,456 INFO L225 Difference]: With dead ends: 163 [2019-01-08 14:20:43,456 INFO L226 Difference]: Without dead ends: 109 [2019-01-08 14:20:43,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 14:20:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-08 14:20:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-08 14:20:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-08 14:20:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-08 14:20:43,462 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-08 14:20:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:43,462 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-08 14:20:43,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-08 14:20:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-08 14:20:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-08 14:20:43,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:43,463 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-08 14:20:43,463 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:43,464 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-08 14:20:43,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:43,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:43,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:43,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:43,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 14:20:45,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:45,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:45,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:45,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:45,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:45,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:45,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:45,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:45,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 14:20:45,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 14:20:48,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:48,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-08 14:20:48,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:48,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-08 14:20:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-08 14:20:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 14:20:48,318 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-08 14:20:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:48,619 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-08 14:20:48,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 14:20:48,619 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-08 14:20:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:48,620 INFO L225 Difference]: With dead ends: 166 [2019-01-08 14:20:48,620 INFO L226 Difference]: Without dead ends: 111 [2019-01-08 14:20:48,621 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-01-08 14:20:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-08 14:20:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-08 14:20:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-08 14:20:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-08 14:20:48,625 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-08 14:20:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:48,625 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-08 14:20:48,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-08 14:20:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-08 14:20:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-08 14:20:48,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:48,626 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-08 14:20:48,626 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-08 14:20:48,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:48,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:48,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-08 14:20:49,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:49,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:49,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:49,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:49,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:49,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:49,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:49,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:51,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-08 14:20:51,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:51,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:51,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-08 14:20:51,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:20:51,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:20:51,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-08 14:23:02,602 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:02,603 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:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. 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-01-08 14:23:02,608 INFO L168 Benchmark]: Toolchain (without parser) took 266677.20 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-01-08 14:23:02,610 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:23:02,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:23:02,611 INFO L168 Benchmark]: Boogie Preprocessor took 23.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:23:02,611 INFO L168 Benchmark]: RCFGBuilder took 330.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:23:02,612 INFO L168 Benchmark]: TraceAbstraction took 266277.98 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:23:02,615 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.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 330.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 266277.98 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: 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...