java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:31:33,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:31:33,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:31:33,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:31:33,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:31:33,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:31:33,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:31:33,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:31:33,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:31:33,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:31:33,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:31:33,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:31:33,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:31:33,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:31:33,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:31:33,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:31:33,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:31:33,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:31:33,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:31:33,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:31:33,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:31:33,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:31:33,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:31:33,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:31:33,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:31:33,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:31:33,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:31:33,830 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:31:33,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:31:33,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:31:33,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:31:33,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:31:33,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:31:33,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:31:33,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:31:33,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:31:33,838 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:31:33,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:31:33,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:31:33,858 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:31:33,858 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:31:33,859 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:31:33,859 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:31:33,859 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:31:33,859 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:31:33,859 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:31:33,860 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:31:33,860 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:31:33,860 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:31:33,860 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:31:33,861 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:31:33,861 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:31:33,861 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:31:33,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:31:33,861 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:31:33,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:31:33,862 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:31:33,862 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:31:33,862 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:31:33,862 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:31:33,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:31:33,863 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:31:33,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:31:33,863 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:31:33,863 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:31:33,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:31:33,864 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:31:33,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:31:33,864 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:31:33,864 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:31:33,864 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:31:33,865 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:31:33,865 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:31:33,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:31:33,865 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:31:33,865 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:31:33,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:31:33,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:31:33,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:31:33,921 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:31:33,921 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:31:33,922 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl [2018-12-03 17:31:33,922 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl' [2018-12-03 17:31:33,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:31:33,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:31:33,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:31:33,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:31:33,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:31:33,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:33,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:33,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:31:33,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:31:34,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:31:34,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:31:34,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:34,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:34,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:34,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:34,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:34,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:34,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... [2018-12-03 17:31:34,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:31:34,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:31:34,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:31:34,024 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:31:34,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:31:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:31:34,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:31:34,314 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:31:34,314 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:31:34,315 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:31:34 BoogieIcfgContainer [2018-12-03 17:31:34,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:31:34,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:31:34,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:31:34,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:31:34,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:33" (1/2) ... [2018-12-03 17:31:34,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aad8630 and model type const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:31:34, skipping insertion in model container [2018-12-03 17:31:34,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:31:34" (2/2) ... [2018-12-03 17:31:34,324 INFO L112 eAbstractionObserver]: Analyzing ICFG const1.i_3.bpl [2018-12-03 17:31:34,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:31:34,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:31:34,363 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:31:34,402 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:31:34,402 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:31:34,402 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:31:34,403 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:31:34,403 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:31:34,403 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:31:34,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:31:34,403 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:31:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:31:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:31:34,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:34,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:31:34,433 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:34,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 17:31:34,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:34,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:34,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:34,794 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 17:31:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:34,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:31:34,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:31:34,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:31:34,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:31:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:31:34,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:31:34,829 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 17:31:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:34,857 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:31:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:31:34,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:31:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:34,871 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:31:34,871 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 17:31:34,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:31:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 17:31:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 17:31:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 17:31:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 17:31:34,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 17:31:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:34,913 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 17:31:34,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:31:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 17:31:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:31:34,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:34,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:31:34,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:34,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 17:31:34,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:34,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:34,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:35,302 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 17:31:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:35,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:35,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:35,304 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 17:31:35,306 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 17:31:35,360 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:31:35,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:31:35,454 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:31:35,850 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:31:35,851 INFO L272 AbstractInterpreter]: Visited 4 different actions 32 times. Merged at 3 different actions 26 times. Widened at 2 different actions 11 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:31:35,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:35,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:31:35,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:35,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:35,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:35,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:35,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:36,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:36,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:36,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 17:31:36,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:36,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:31:36,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:31:36,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:31:36,121 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 17:31:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:36,159 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 17:31:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:31:36,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 17:31:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:36,160 INFO L225 Difference]: With dead ends: 8 [2018-12-03 17:31:36,160 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 17:31:36,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:31:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 17:31:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 17:31:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:31:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 17:31:36,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 17:31:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:36,165 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 17:31:36,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:31:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 17:31:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:31:36,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:36,167 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 17:31:36,167 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:36,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 17:31:36,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:36,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:36,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:36,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:36,563 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 17:31:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:36,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:36,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:36,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:36,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:36,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:36,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:36,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:36,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:36,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:31:36,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:36,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:36,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 17:31:36,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:36,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:31:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:31:36,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:31:36,826 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 17:31:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:36,858 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 17:31:36,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:31:36,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 17:31:36,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:36,859 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:31:36,860 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:31:36,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:31:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:31:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:31:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:31:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 17:31:36,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 17:31:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:36,864 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 17:31:36,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:31:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 17:31:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:31:36,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:36,865 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 17:31:36,865 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:36,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 17:31:36,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:36,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:36,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:36,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:36,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:37,228 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 17:31:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:37,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:37,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:37,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:37,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:37,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:37,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:37,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:37,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:37,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:37,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:37,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:37,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:38,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:38,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 17:31:38,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:38,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:31:38,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:31:38,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:31:38,230 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 17:31:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:38,284 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 17:31:38,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:31:38,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 17:31:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:38,285 INFO L225 Difference]: With dead ends: 10 [2018-12-03 17:31:38,285 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 17:31:38,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:31:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 17:31:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 17:31:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 17:31:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 17:31:38,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 17:31:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:38,290 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 17:31:38,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:31:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 17:31:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:31:38,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:38,291 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 17:31:38,291 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:38,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 17:31:38,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:38,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:38,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:38,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:38,807 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 17:31:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:38,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:38,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:38,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:38,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:38,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:38,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:38,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:38,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:38,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:39,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:39,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 17:31:39,392 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:39,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:31:39,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:31:39,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:31:39,393 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 17:31:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:39,444 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 17:31:39,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:31:39,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 17:31:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:39,447 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:31:39,447 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:31:39,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:31:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:31:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:31:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:31:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 17:31:39,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 17:31:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:39,451 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 17:31:39,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:31:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 17:31:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:31:39,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:39,452 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 17:31:39,452 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:39,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 17:31:39,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:39,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:39,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:39,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:39,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:39,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:39,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:39,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:39,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:39,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:39,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:39,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:39,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:31:39,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:39,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:39,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:42,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:42,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 17:31:42,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:42,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:31:42,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:31:42,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:31:42,606 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 17:31:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:42,669 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 17:31:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:31:42,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 17:31:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:42,671 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:31:42,671 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 17:31:42,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:31:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 17:31:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 17:31:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 17:31:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 17:31:42,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 17:31:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:42,676 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 17:31:42,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:31:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 17:31:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:31:42,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:42,677 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 17:31:42,677 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:42,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:42,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 17:31:42,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:42,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:42,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:42,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:42,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:42,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:42,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:42,926 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:42,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:42,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:42,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:42,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:42,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:42,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:42,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:42,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:42,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:46,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:46,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 17:31:46,344 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:46,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:31:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:31:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:31:46,345 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 17:31:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:46,401 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 17:31:46,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:31:46,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 17:31:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:46,403 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:31:46,403 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:31:46,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:31:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:31:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:31:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:31:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 17:31:46,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 17:31:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:46,407 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 17:31:46,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:31:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 17:31:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:31:46,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:46,408 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 17:31:46,409 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:46,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 17:31:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:46,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:46,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:46,976 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 17:31:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:46,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:46,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:46,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:46,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:46,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:46,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:46,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:46,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:47,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:47,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:49,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:49,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 17:31:49,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:31:49,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:31:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:31:49,610 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 17:31:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:49,708 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 17:31:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:31:49,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 17:31:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:49,710 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:31:49,710 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 17:31:49,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:31:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 17:31:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 17:31:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 17:31:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 17:31:49,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 17:31:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:49,715 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 17:31:49,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:31:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 17:31:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:31:49,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:49,716 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 17:31:49,717 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:49,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 17:31:49,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:49,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:49,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:49,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:49,944 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:49,944 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:49,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:49,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:49,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:49,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:49,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:49,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:31:49,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:49,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:50,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:57,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 17:31:57,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:57,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:31:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:31:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:31:57,417 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 17:31:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:57,570 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 17:31:57,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:31:57,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 17:31:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:57,571 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:31:57,571 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:31:57,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:31:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:31:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:31:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:31:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 17:31:57,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 17:31:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:57,576 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 17:31:57,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:31:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 17:31:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:31:57,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:57,577 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 17:31:57,577 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:57,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 17:31:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:57,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:57,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:57,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:57,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:57,883 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:57,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:57,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:57,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:57,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:57,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:57,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:57,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:57,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:57,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:05,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:05,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 17:32:05,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:05,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:32:05,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:32:05,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:32:05,167 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 17:32:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:05,311 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 17:32:05,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:32:05,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 17:32:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:05,312 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:32:05,312 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 17:32:05,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:32:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 17:32:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 17:32:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:32:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 17:32:05,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 17:32:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:05,316 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 17:32:05,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:32:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 17:32:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:32:05,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:05,317 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 17:32:05,317 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:05,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 17:32:05,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:05,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:05,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:05,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:05,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:05,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:05,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:05,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:05,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:05,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:05,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:05,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:05,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:16,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:16,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 17:32:16,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:16,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:32:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:32:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:32:16,639 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 17:32:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:16,762 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 17:32:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:32:16,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 17:32:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:16,764 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:32:16,764 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:32:16,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:32:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:32:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:32:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:32:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 17:32:16,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 17:32:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:16,769 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 17:32:16,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:32:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 17:32:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:32:16,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:16,770 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 17:32:16,770 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:16,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:16,771 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 17:32:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:16,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:17,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:17,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:17,072 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:17,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:17,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:17,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:17,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:17,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:17,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 17:32:17,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:17,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:17,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:30,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 17:32:30,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:30,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:32:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:32:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:32:30,032 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 17:32:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:30,497 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 17:32:30,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:32:30,498 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 17:32:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:30,499 INFO L225 Difference]: With dead ends: 18 [2018-12-03 17:32:30,499 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 17:32:30,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:32:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 17:32:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 17:32:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:32:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 17:32:30,505 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 17:32:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:30,505 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 17:32:30,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:32:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 17:32:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:32:30,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:30,506 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 17:32:30,506 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:30,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:30,507 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 17:32:30,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:30,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:30,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:30,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:30,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:30,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:30,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:30,867 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:30,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:30,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:30,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:30,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:30,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:30,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:30,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:30,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:31,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:44,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:44,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 17:32:44,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:44,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:32:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:32:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:32:44,306 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 17:32:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:44,564 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 17:32:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:32:44,564 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 17:32:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:44,565 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:32:44,565 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:32:44,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:32:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:32:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:32:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:32:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 17:32:44,570 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 17:32:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:44,571 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 17:32:44,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:32:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 17:32:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:32:44,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:44,571 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 17:32:44,572 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:44,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:44,572 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 17:32:44,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:44,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:44,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:44,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:44,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:44,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:44,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:44,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:44,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:44,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:44,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:32:44,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:44,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:44,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:45,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:00,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:00,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 17:33:00,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:00,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:33:00,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:33:00,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:33:00,497 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 17:33:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:00,702 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 17:33:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:33:00,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:33:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:00,704 INFO L225 Difference]: With dead ends: 20 [2018-12-03 17:33:00,704 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:33:00,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:33:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:33:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:33:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:33:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 17:33:00,712 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 17:33:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:00,712 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 17:33:00,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:33:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 17:33:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:33:00,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:00,713 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 17:33:00,713 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:00,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 17:33:00,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:00,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:00,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:00,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:00,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:00,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:00,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:00,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:00,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:00,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:00,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:00,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:00,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:01,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:33:01,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:01,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:01,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:01,566 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 17:33:02,792 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:04,654 WARN L180 SmtUtils]: Spent 776.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:06,837 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:08,567 WARN L180 SmtUtils]: Spent 757.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:11,668 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:14,493 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:17,844 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:19,764 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:22,132 WARN L180 SmtUtils]: Spent 846.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:24,829 WARN L180 SmtUtils]: Spent 787.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:33:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:25,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:25,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 17:33:25,131 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:25,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:33:25,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:33:25,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=737, Unknown=1, NotChecked=0, Total=1056 [2018-12-03 17:33:25,133 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 17:33:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:25,329 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 17:33:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:33:25,331 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 17:33:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:25,332 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:33:25,332 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:33:25,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=318, Invalid=737, Unknown=1, NotChecked=0, Total=1056 [2018-12-03 17:33:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:33:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:33:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:33:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 17:33:25,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 17:33:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:25,336 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 17:33:25,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:33:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 17:33:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:33:25,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:25,337 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 17:33:25,338 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:25,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:25,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 17:33:25,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:25,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:25,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:25,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:25,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:25,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:25,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:25,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:25,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:25,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:25,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:25,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:25,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:25,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:25,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:48,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:48,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 17:33:48,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:48,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:33:48,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:33:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:33:48,174 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 17:33:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:48,432 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 17:33:48,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:33:48,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 17:33:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:48,433 INFO L225 Difference]: With dead ends: 22 [2018-12-03 17:33:48,433 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:33:48,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:33:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:33:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 17:33:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:33:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 17:33:48,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 17:33:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:48,439 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 17:33:48,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:33:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 17:33:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:33:48,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:48,440 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 17:33:48,440 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:48,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:48,441 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 17:33:48,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:48,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:48,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:48,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:49,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:49,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:49,103 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:49,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:49,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:49,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:33:49,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:49,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:49,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:49,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:13,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:13,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 17:34:13,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:13,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:34:13,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:34:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:34:13,145 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 17:34:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:13,468 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 17:34:13,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:34:13,470 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 17:34:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:13,470 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:34:13,471 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:34:13,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:34:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:34:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:34:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:34:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 17:34:13,475 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 17:34:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:13,475 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 17:34:13,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:34:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 17:34:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:34:13,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:13,476 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 17:34:13,476 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:13,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 17:34:13,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:13,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:13,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:13,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:13,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:13,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:13,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:13,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:13,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:13,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:13,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:13,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:13,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:18,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:34:18,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:18,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:18,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:46,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:46,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 17:34:46,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:46,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:34:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:34:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:34:46,217 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 17:34:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:46,557 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 17:34:46,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:34:46,558 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 17:34:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:46,559 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:34:46,559 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:34:46,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:34:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:34:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 17:34:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:34:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 17:34:46,564 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 17:34:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:46,565 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 17:34:46,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:34:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 17:34:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:34:46,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:46,566 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 17:34:46,566 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:46,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:46,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 17:34:46,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:46,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:46,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:46,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:46,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:46,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:46,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:46,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:46,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:46,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:46,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:46,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:46,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:47,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:22,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:22,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 17:35:22,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:22,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:35:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:35:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:35:22,840 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 17:35:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:23,101 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 17:35:23,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:35:23,101 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 17:35:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:23,102 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:35:23,103 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:35:23,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:35:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:35:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:35:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:35:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 17:35:23,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 17:35:23,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:23,116 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 17:35:23,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:35:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 17:35:23,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:35:23,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:23,117 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 17:35:23,118 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:23,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:23,118 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 17:35:23,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:23,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:23,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:23,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:23,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:23,473 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:23,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:23,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:23,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:23,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:23,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:35:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:23,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:23,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:56,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:56,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 17:35:56,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:56,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:35:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:35:56,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:35:56,468 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 17:35:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:56,793 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 17:35:56,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:35:56,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 17:35:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:56,795 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:35:56,796 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:35:56,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:35:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:35:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 17:35:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:35:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 17:35:56,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 17:35:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:56,800 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 17:35:56,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:35:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 17:35:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:35:56,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:56,801 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 17:35:56,802 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:56,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 17:35:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:56,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:56,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:57,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:57,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:57,355 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:57,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:57,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:57,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:57,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:59,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:35:59,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:59,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:59,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:38,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:38,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 17:36:38,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:38,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:36:38,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:36:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:36:38,803 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 17:36:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:39,304 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 17:36:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:36:39,305 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 17:36:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:39,306 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:36:39,306 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:36:39,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:36:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:36:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:36:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:36:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 17:36:39,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 17:36:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:39,312 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 17:36:39,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:36:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 17:36:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:36:39,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:39,313 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 17:36:39,313 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:39,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 17:36:39,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:39,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:39,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:39,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:39,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:39,806 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:39,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:39,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:39,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:39,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:39,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:39,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:39,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:39,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:39,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:24,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:24,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 17:37:24,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:24,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:37:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:37:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:37:24,565 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 17:37:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:24,916 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 17:37:24,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:37:24,918 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 17:37:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:24,918 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:37:24,918 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:37:24,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:37:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:37:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 17:37:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:37:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 17:37:24,924 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 17:37:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:24,924 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 17:37:24,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:37:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 17:37:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:37:24,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:24,925 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 17:37:24,925 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:24,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 17:37:24,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:24,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:24,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:24,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:24,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:25,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:25,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:25,783 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:25,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:25,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:25,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:25,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:25,792 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:25,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:25,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:09,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:09,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 17:38:09,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:09,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:38:09,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:38:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:38:09,544 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 17:38:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:10,480 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 17:38:10,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:38:10,481 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 17:38:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:10,481 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:38:10,481 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:38:10,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:38:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:38:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:38:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:38:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 17:38:10,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 17:38:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:10,487 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 17:38:10,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:38:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 17:38:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:38:10,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:10,488 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 17:38:10,489 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:10,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 17:38:10,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:10,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:10,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:10,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:10,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:10,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:10,973 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:10,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:10,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:10,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:10,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:38:10,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:38:11,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:38:11,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:11,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:11,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:09,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:09,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 17:39:09,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:09,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:39:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:39:09,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:39:09,605 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 17:39:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:10,208 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 17:39:10,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:39:10,208 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 17:39:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:10,209 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:39:10,209 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:39:10,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:39:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:39:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 17:39:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:39:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 17:39:10,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 17:39:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:10,216 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 17:39:10,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:39:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 17:39:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:39:10,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:10,217 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 17:39:10,217 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:10,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 17:39:10,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:10,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:10,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:10,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:10,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:10,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:10,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:10,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:10,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:10,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:10,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:10,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:39:10,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:39:10,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:39:10,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:10,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:10,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:10,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:10,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 17:40:10,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:10,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:40:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:40:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:40:10,619 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 17:40:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:11,073 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 17:40:11,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:40:11,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 17:40:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:11,074 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:40:11,075 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:40:11,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:40:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:40:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:40:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:40:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 17:40:11,081 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 17:40:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:11,081 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 17:40:11,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:40:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 17:40:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:40:11,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:11,082 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 17:40:11,082 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:11,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 17:40:11,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:11,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:11,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:11,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:11,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:12,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:12,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:12,219 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:12,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:12,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:12,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:12,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:12,229 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:12,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:12,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:14,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:14,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 17:41:14,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:14,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:41:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:41:14,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:41:14,766 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 17:41:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:15,257 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 17:41:15,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:41:15,257 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 17:41:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:15,258 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:41:15,258 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:41:15,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 63.5s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:41:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:41:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 17:41:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:41:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 17:41:15,263 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 17:41:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:15,263 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 17:41:15,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:41:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 17:41:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 17:41:15,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:15,264 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 17:41:15,264 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:15,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 17:41:15,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:15,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:15,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:15,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:15,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:16,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:16,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:16,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:16,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:16,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:16,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:41:16,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:16,422 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:19,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:41:19,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:19,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:19,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:31,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:31,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 17:42:31,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:31,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:42:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:42:31,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:42:31,787 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 17:42:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:32,324 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 17:42:32,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:42:32,325 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 17:42:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:32,326 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:42:32,326 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:42:32,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:42:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:42:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:42:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:42:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 17:42:32,332 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 17:42:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:32,332 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 17:42:32,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:42:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 17:42:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:42:32,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:32,333 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 17:42:32,333 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:32,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 17:42:32,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:32,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:32,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:32,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:33,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:33,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:33,077 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:33,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:42:33,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:33,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:42:33,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:33,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:33,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:33,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:33,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:33,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:47,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:47,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 17:43:47,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:47,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:43:47,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:43:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:43:47,384 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 17:43:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:47,951 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 17:43:47,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:43:47,952 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 17:43:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:47,952 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:43:47,952 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:43:47,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 74.9s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:43:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:43:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 17:43:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:43:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 17:43:47,958 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 17:43:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:47,959 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 17:43:47,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:43:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 17:43:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:43:47,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:47,959 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 17:43:47,960 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:47,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 17:43:47,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:47,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:47,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:49,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:49,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:49,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:49,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:49,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:49,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:43:49,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:49,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:43:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:49,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:49,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:01,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:45:01,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 17:45:01,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:45:01,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:45:01,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:45:01,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:45:01,141 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 17:45:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:45:01,741 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 17:45:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:45:01,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 17:45:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:45:01,742 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:45:01,742 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:45:01,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 73.0s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:45:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:45:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:45:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:45:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 17:45:01,748 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 17:45:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:45:01,749 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 17:45:01,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:45:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 17:45:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:45:01,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:45:01,749 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 17:45:01,750 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:45:01,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:45:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 17:45:01,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:45:01,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:01,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:45:01,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:01,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:45:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:02,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:02,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:45:02,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:45:02,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:45:02,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:02,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:45:02,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:45:02,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:45:06,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:45:06,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:45:06,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:45:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:06,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:07,456 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 17:45:07,995 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-03 17:45:09,419 WARN L180 SmtUtils]: Spent 884.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:11,211 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:13,293 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:14,764 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:16,147 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:17,370 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:19,478 WARN L180 SmtUtils]: Spent 807.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:21,063 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:23,993 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:27,183 WARN L180 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:31,665 WARN L180 SmtUtils]: Spent 777.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:36,924 WARN L180 SmtUtils]: Spent 784.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:38,606 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:42,666 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:48,154 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:54,079 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:57,100 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:45:59,134 WARN L180 SmtUtils]: Spent 764.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:46:02,003 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:46:04,441 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 17:46:09,525 WARN L180 SmtUtils]: Spent 774.00 ms on a formula simplification that was a NOOP. DAG size: 12